Skip to main content
SpringerLink
Log in

An Overview on Execution Strategies for Linked Data Queries

  • Schwerpunktbeitrag
  • Published:
Datenbank-Spektrum Aims and scope Submit manuscript

Abstract

The publication of Linked Open Data on the Web has gained tremendous momentum over the last five years. This development makes possible (and interesting) the execution of queries using up-to-date data from multiple, automatically discovered data sources. As a result, we currently witness the emergence of a new research area that focuses on an online execution of Linked Data queries; i.e. queries that range over data that is made available using the Linked Data publishing principles.

This article provides a general overview on this new area. In particular, we introduce the specific challenges that need to be addressed and then focus on possible strategies for executing Linked Data queries. Furthermore, we classify approaches proposed in the literature w.r.t. these strategies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. For a more comprehensive introduction to publishing Linked Data we refer to Heath and Bizer’s recent book [21].

  2. Using the RDFa standard, Linked Data can even be embedded in HTML documents [1], allowing publishers to serve a single type of document for human and machine consumption.

  3. http://www.robotstxt.org/.

References

  1. Adida B, Birbeck M, McCarron S, Herman I (2012) RDFa core 1.1—syntax and processing rules for embedding RDF through attributes. W3C rec. Available online at: http://www.w3.org/TR/rdfa-core/

  2. Batsakis S, Petrakis EGM, Milios E (2009) Improving the performance of focused web crawlers. Data Knowl Eng 68(10):1001–1013

    Article  Google Scholar 

  3. Berners-Lee T (2006) Design issues: linked data. Available online at: http://www.w3.org/DesignIssues/LinkedData.html

  4. Bizer C, Heath T, Berners-Lee T (2009) Linked data—the story so far. Int J Semantic Web Inf Syst 5(3):1–22

    Article  Google Scholar 

  5. Bouquet P, Ghidini C, Serafini L (2009) Querying the web of data: a formal approach. In: Proc of the 4th Asian semantic web conference (ASWC)

    Google Scholar 

  6. Chakrabarti S, van den Berg M, Dom B (1999) Focused crawling: a new approach to topic-specific web resource discovery. Comput Netw 31(11–16):1623–1640

    Article  Google Scholar 

  7. Clark KG, Feigenbaum L, Torres E (2008) SPARQL protocol for RDF. W3C rec. Available online at: http://www.w3.org/TR/rdf-sparql-protocol/

  8. Diligenti M, Coetzee F, Lawrence S, Giles CL, Gori M (2000) Focused crawling using context graphs. In: Proc of the 26th int conf on very large data bases (VLDB)

    Google Scholar 

  9. Ding L, Shinavier J, Shangguan Z, McGuinness DL (2010) SameAs networks and beyond: analyzing deployment status and implications of owl: sameAs in linked data. In: Proc of the 9th international semantic web conference (ISWC)

    Google Scholar 

  10. Dolog P, Stuckenschmidt H, Wache H, Diederich J (2009) Relaxing RDF queries based on user and domain preferences. J Intell Inf Syst 33(3):239–260

    Article  Google Scholar 

  11. Görlitz O, Staab S (2011) Federated data management and query optimization for linked open data. In: New directions in web data management 1, pp 109–137

    Chapter  Google Scholar 

  12. Harth A, Decker S (2005) Optimized index structures for querying RDF from the web. In: Proc of the 3rd Latin American web congress (LA-web)

    Google Scholar 

  13. Harth A, Hose K, Karnstedt M, Polleres A, Sattler K-U, Umbrich J (2010) Data summaries for on-demand queries over linked data. In: Proc of the 19th int conf on world wide web (WWW)

    Google Scholar 

  14. Harth A, Speiser S (2012) On completeness classes for query evaluation on linked data. In: Proc of the 26th AAAI conference

    Google Scholar 

  15. Hartig O (2011) How caching improves efficiency and result completeness for querying linked data. In: Proc of the 4th linked data on the web workshop (LDOW)

    Google Scholar 

  16. Hartig O (2011) Zero-knowledge query planning for an iterator implementation of link traversal based query execution. In: Proc of the 8th extended semantic web conference (ESWC)

    Google Scholar 

  17. Hartig O (2012) SPARQL for a web of linked data: semantics and computability. In: Proc of the 9th extended semantic web conference (ESWC)

    Google Scholar 

  18. Hartig O, Bizer C, Freytag J-C (2009) Executing SPARQL queries over the Web of Linked Data. In: Proc of the 8th international semantic web conference (ISWC)

    Google Scholar 

  19. Hartig O, Freytag J-C (2012) Foundations of traversal based query execution over linked data. In: Proc of the 23rd ACM conference on hypertext and social media (HT)

    Google Scholar 

  20. Hartig O, Langegger A (2010) A database perspective on consuming linked data on the web. Datenbank-Spektrum 10(2)

  21. Heath T, Bizer C (2011) Linked data: evolving the web into a global data space. Morgan & Claypool

  22. Hogan A, Harth A, Umrich J, Kinsella S, Polleres A, Decker S (2012) Searching and browsing linked data with SWSE: the semantic web search engine. Web semantics: science, services and agents on the world wide web 9(4)

  23. Hogan A, Mellotte M, Powell G, Stampouli D (2012) Towards fuzzy query-relaxation for RDF. In: Proc of the 9th extended semantic web conference (ESWC)

    Google Scholar 

  24. Huang H, Liu C, Zhou X (2012) Approximating query answering on RDF databases. World Wide Web J 15(1):89–114

    Article  MathSciNet  Google Scholar 

  25. Joshi AK, Jain P, Hitzler P, Yeh PZ, Verma K, Sheth AP, Damova M (2012) Alignment-based querying of linked open data. In: Proc of the 11th int conference on ontologies, DataBases, and applications of semantics (ODBASE)

    Google Scholar 

  26. Ladwig G, Tran DT (2010) Linked data query processing strategies. In: Proc of the 9th international semantic web conference (ISWC)

    Google Scholar 

  27. Ladwig G, Tran DT (2011) SIHJoin: querying remote and local linked data. In: Proc of the 8th extended semantic web conference (ESWC)

    Google Scholar 

  28. Makris K, Gioldasis N, Bikakis N, Christodoulakis S (2010) Ontology mapping and SPARQL rewriting for querying federated RDF data sources. In: Proceedings of OTM conferences

    Google Scholar 

  29. Mika P, Potter T (2012) Metadata statistics for a large web corpus. In: Proc of the 5th linked data on the web workshop (LDOW)

    Google Scholar 

  30. Miranker DP, Depena RK, Jung H, Sequeda JF, Reyna C (2012) Diamond: a SPARQL query engine, for linked data based on the Rete match. In: Proc of the workshop on artificial intelligence meets the web of data (AImWD)

    Google Scholar 

  31. Mühleisen H, Bizer C (2012) Web data commons—extracting structured data from two large web corpora. In: Proc of the 5th linked data on the web workshop (LDOW)

    Google Scholar 

  32. Neumann T, Weikum G (2008) RDF-3X: a RISC-style engine for RDF. In: Proc of the 34th int conf on very large data bases (VLDB)

    Google Scholar 

  33. Paret E, Van Woensel W, Casteleyn S, Signer B, De Troyer O (2011) Efficient querying of distributed RDF sources in mobile settings based on a source index model. In: Procedia CS

    Google Scholar 

  34. Prud’hommeaux E, Buil-Aranda C (2013) SPARQL 1.1 federated query. W3C rec. Available online at: http://www.w3.org/TR/sparql11-federated-query/

  35. Prud’hommeaux E, Seaborne A (2008) SPARQL query language for RDF. W3C rec. Available online at: http://www.w3.org/TR/rdf-sparql-query/

  36. Schmedding F (2011) Incremental SPARQL evaluation for query answering on linked data. In: Proc of the 2nd int workshop on consuming linked data (COLD)

    Google Scholar 

  37. Schneider M (2012) OWL 2 web ontology language, RDF-based semantics, 2nd edn. W3C rec. Available online at: http://www.w3.org/TR/owl2-rdf-based-semantics/

  38. Tian Y, Umbrich J, Yu Y (2011) Enhancing source selection for live queries over linked data via query log mining. In: Proc of the joint int semantic technology conference (JIST)

    Google Scholar 

  39. Umbrich J, Hogan A, Polleres A, Decker S (2012) Improving the recall of live linked data querying through reasoning. In: Proc of the 6th int conference on web reasoning and rule systems (RR)

    Google Scholar 

  40. Umbrich J, Hose K, Karnstedt M, Harth A, Polleres A (2011) Comparing data summaries for processing live queries over linked data. World Wide Web J 14(5–6):495–544

    Article  Google Scholar 

  41. Wagner A, Tran T, Ladwig G, Harth A (2012) Top-k linked data query processing. In: Proc of the 9th extended semantic web conference (ESWC)

    Google Scholar 

  42. Weiss C, Karras P, Bernstein A (2008) Hexastore: sextuple indexing for semantic web data management. In: Proc of the 34th international conference on very large data bases (VLDB)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. David R. Cheriton School of Computer Science, University of Waterloo, 200 University Ave West, Waterloo, Ontario, N2L 3G1, Canada

    Olaf Hartig

Authors
  1. Olaf Hartig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olaf Hartig.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hartig, O. An Overview on Execution Strategies for Linked Data Queries. Datenbank Spektrum 13, 89–99 (2013). https://doi.org/10.1007/s13222-013-0122-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13222-013-0122-1

Keywords

Search

Navigation