Abstract
Link traversal based query execution is a new query execution paradigm for the Web of Data. This approach allows the execution engine to discover potentially relevant data during the query execution and, thus, enables users to tap the full potential of the Web. In earlier work we propose to implement the idea of link traversal based query execution using a synchronous pipeline of iterators. While this idea allows for an easy and efficient implementation, it introduces restrictions that cause less comprehensive result sets. In this paper we address this limitation. We analyze the restrictions and discuss how the evaluation order of a query may affect result set size and query execution costs. To identify a suitable order, we propose a heuristic for our scenario where no a-priory information about relevant data sources is present. We evaluate this heuristic by executing real-world queries over the Web of Data.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Hartig, O., Langegger, A.: A database perspective on consuming Linked Data on the Web. Datenbank-Spektrum 10(2) (2010)
Hartig, O., Bizer, C., Freytag, J.-C.: Executing SPARQL queries over the web of linked data. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 293–309. Springer, Heidelberg (2009)
Ladwig, G., Tran, D.T.: Linked data query processing strategies. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010, Part I. LNCS, vol. 6496, pp. 453–469. Springer, Heidelberg (2010)
Prud’hommeaux, E., Seaborne, A.: SPARQL query language for RDF. W3C Rec. (2008), http://www.w3.org/TR/rdf-sparql-query/
Hartig, O.: Iterator based implementations of link traversal based query execution (2010), http://squin.org/doc/IteratorImplementation/
Hartig, O.: A main memory index structure to query linked data. In: Proc. of the 4th Int. Linked Data on the Web workshop (LDOW) at WWW (2011)
Hartig, O., Mühleisen, H., Freytag, J.C.: Linked Data for building a map of researchers. In: Proc. of 5th Workshop on Scripting and Development for the Semantic Web (SFSW) at ESWC (2009)
Hartig, O., Zhao, J.: Publishing and consuming provenance metadata on the Web of Linked Data. In: Proc. of the Int. Provenance and Annotation Workshop (2010)
Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: Proc. of the Int. Conference on Management of Data (1979)
Mendelzon, A.O., Milo, T.: Formal models of Web queries. Information Systems 23(8) (1998)
Bouquet, P., Ghidini, C., Serafini, L.: Querying the web of data: A formal approach. In: Gómez-Pérez, A., Yu, Y., Ding, Y. (eds.) ASWC 2009. LNCS, vol. 5926, pp. 291–305. Springer, Heidelberg (2009)
Harth, A., Hose, K., Karnstedt, M., Polleres, A., Sattler, K.U., Umbrich, J.: Data summaries for on-demand queries over Linked Data. In: Proc. of the 19th Int. Conference on World Wide Web, WWW (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartig, O. (2011). Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution. In: Antoniou, G., et al. The Semantic Web: Research and Applications. ESWC 2011. Lecture Notes in Computer Science, vol 6643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21034-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-21034-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21033-4
Online ISBN: 978-3-642-21034-1
eBook Packages: Computer ScienceComputer Science (R0)