Hypermedia-Based Discovery for Source Selection Using Low-Cost Linked Data Interfaces
TL;DR: The authors introduce a discovery approach for Linked Data interfaces based on hypermedia links and controls, and apply it to federated query execution with Triple Pattern Fragments, and identify quantitative metrics to evaluate this discovery approach.
read more
Abstract: Evaluating federated Linked Data queries requires consulting multiple sources on the Web. Before a client can execute queries, it must discover data sources, and determine which ones are relevant. Federated query execution research focuses on the actual execution, while data source discovery is often marginally discussed-even though it has a strong impact on selecting sources that contribute to the query results. Therefore, the authors introduce a discovery approach for Linked Data interfaces based on hypermedia links and controls, and apply it to federated query execution with Triple Pattern Fragments. In addition, the authors identify quantitative metrics to evaluate this discovery approach. This article describes generic evaluation measures and results for their concrete approach. With low-cost data summaries as seed, interfaces to eight large real-world datasets can discover each other within 7 minutes. Hypermedia-based client-side querying shows a promising gain of up to 50% in execution time, but demands algorithms that visit a higher number of interfaces to improve result completeness.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures

Table 4. Reactive appends the backlinked interfaces to the active discovery results. (#F=number of fragments, #S=number of fragments stored in index, #Req=number of sent requests, ASCT=Avg. Summary construction time, AET=Avg. Execution time) 
Figure 7. Hypermedia-based querying with a discovery index is slightly faster compared to full-index servers, and for some queries up to 50% faster 
Table 2. The compression rate of data summaries is very high (99%) with acceptable creation time (11 min) 
Figure 1. Active discovery discovers Linked Data interfaces by dereferencing foreign URIs in the dataset and retrieving the linked Triple Pattern Fragment 
Figure 3. Determine if a given triple pattern matches a data summary, and possibly its dataset 
Figure 4. The data summary generation time increases linearly with the number of distinct subjects and objects
Citations
Using a Personal Health Library-Enabled mHealth Recommender System for Self-Management of Diabetes Among Underserved Populations: Use Case for Knowledge Graphs and Linked Data.
Nariman Ammar,James E. Bailey,Robert L. Davis,Arash Shaban-Nejad +3 more
- 16 Mar 2021
TL;DR: In this paper, the authors report the implementation of a mobile health digital intervention that incorporates both digital health data stored in patients' personal health libraries and other sources of contextual knowledge to deliver tailored recommendations for improving self-care behaviors in diabetic adults.
Using a Personal Health Library-Enabled mHealth Recommender System for Self-Management of Diabetes Among Underserved Populations: Use Case for Knowledge Graphs and Linked Data
TL;DR: In this article, the authors report the implementation of a mobile health digital intervention that incorporates both digital health data stored in patients personal health libraries and other sources of contextual knowledge to deliver tailored recommendations for improving self-care behaviors in diabetic adults.
Semantic Extension of Query for the Linked Data
TL;DR: In this paper, the authors present some new semantic properties for predicates in RDF triples and design a Semantic Matrix for Predicates (SMP), which is a well-defined framework for the notion of Semantically Extended Query Model for the Linked Data (SEQMLD).
8
An ontology alignment framework for data-driven microservices
Ivan Salvadori,Bruno C. N. Oliveira,Alexis Huf,Eduardo C. Inacio,Frank Siqueira +4 more
- 04 Dec 2017
TL;DR: This work discusses data integration problems in the context of microservices and proposes an ontology alignment framework aimed at achieving semantic data-driven microservices composition for data integration in multi-ontology scenarios.
7
Automating the Dynamic Interactions of Self-governed Components in Distributed Architectures
Sebastian Bader
- 28 May 2017
TL;DR: An approach is presented which enables components in distributed systems to observe, judge and independently react to dynamic changes in their neighborhood and the target is a delegation of decision making to the single components.
5
References
R-trees: a dynamic index structure for spatial searching
Antonin Guttman
- 01 Jun 1984
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
8K
•Proceedings Article
Hypertext Transfer Protocol -- HTTP/1.1
Roy T. Fielding,James Gettys,Jeffrey C. Mogul,H. Frystyk,Larry Masinter,Paul J. Leach,Tim Berners-Lee +6 more
- 01 Jan 1997
TL;DR: The Hypertext Transfer Protocol is an application-level protocol for distributed, collaborative, hypermedia information systems, which can be used for many tasks beyond its use for hypertext through extension of its request methods, error codes and headers.
4.4K
•Book
Linked Data: Evolving the Web into a Global Data Space
Tom Heath,Christian Bizer,Bebo White +2 more
- 02 Feb 2011
TL;DR: This Synthesis lecture provides readers with a detailed technical introduction to Linked Data, including coverage of relevant aspects of Web architecture, as the basis for application development, research or further study.
2.3K
Querying distributed RDF data sources with SPARQL
Bastian Quilitz,Ulf Leser +1 more
- 01 Jun 2008
TL;DR: DARQ provides transparent query access to multiple SPARQL services, i.e., it gives the user the impression to query one single RDF graph despite the real data being distributed on the web, and uses query rewriting and cost-based query optimization to speed up query execution.
Related Papers (5)
Sandra Sampaio,Pedro Sampaio +1 more
- 01 Jan 2007
Liu Wei,Meng Xiaofeng,Ling Yan-Yan +2 more
- 01 Jan 2008