Linked Data Query Processing Strategies

  • Günter Ladwig
  • Thanh Tran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6496)

Abstract

Recently, processing of queries on linked data has gained attention. We identify and systematically discuss three main strategies: a bottom-up strategy that discovers new sources during query processing by following links between sources, a top-down strategy that relies on complete knowledge about the sources to select and process relevant sources, and a mixed strategy that assumes some incomplete knowledge and discovers new sources at run-time. To exploit knowledge discovered at run-time, we propose an additional step, explicitly scheduled during query processing, called correct source ranking. Additionally, we propose the adoption of stream-based query processing to deal with the unpredictable nature of data access in the distributed Linked Data environment. In experiments, we show that our implementation of the mixed strategy leads to early reporting of results and thus, more responsive query processing, while not requiring complete knowledge.

References

  1. 1.
    Avnur, R., Hellerstein, J.M.: Eddies: continuously adaptive query processing. SIGMOD Rec. 29(2), 261–272 (2000)CrossRefGoogle Scholar
  2. 2.
    Bizer, C., Heath, T., Berners-Lee, T., Heath, T., Hepp, M., Bizer, C.: Linked data - the story so far. International Journal on Semantic Web and Information Systems (IJSWIS) (2009)Google Scholar
  3. 3.
    Deshpande, A., Hellerstein, J.M.: Lifting the burden of history from adaptive query processing. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, vol. 30, pp. 948–959 (2004)Google Scholar
  4. 4.
    Ge, W., Chen, J., Hu, W., Qu, Y.: Object link structure in the semantic web. In: The Semantic Web: Research and Applications, pp. 257–271 (2010)Google Scholar
  5. 5.
    Harth, A., Hose, K., Karnstedt, M., Polleres, A., Sattler, K., Umbrich, J.: Data summaries for on-demand queries over linked data. In: Proceedings of the 19th International Conference on World Wide Web (2010)Google Scholar
  6. 6.
    Hartig, O., Bizer, C., Freytag, J.: 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)CrossRefGoogle Scholar
  7. 7.
    Ives, Z.G., Halevy, A.Y., Weld, D.S.: Adapting to source properties in processing data integration queries. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, Paris, France. ACM, New York (2004)Google Scholar
  8. 8.
    Ives, Z.G., Taylor, N.E.: Sideways information passing for Push-Style query processing. In: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pp. 774–783. IEEE Computer Society, Los Alamitos (2008)CrossRefGoogle Scholar
  9. 9.
    Kader, R.A., Boncz, P., Manegold, S., van Keulen, M.: ROX: run-time optimization of XQueries. In: Proceedings of the 35th SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, pp. 615–626. ACM, New York (2009)CrossRefGoogle Scholar
  10. 10.
    Klyne, G., Carroll, J.J., McBride, B.: Resource description framework (RDF): concepts and abstract syntax (2004)Google Scholar
  11. 11.
    Ladwig, G., Tran, T.: Linked data query processing strategies – technical report. Technical report (2010), http://people.aifb.kit.edu/gla/tr/ldqp_report.pdf
  12. 12.
    Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. Proc. VLDB Endow. 1(1), 647–659 (2008)CrossRefGoogle Scholar
  13. 13.
    Neumann, T., Weikum, G.: Scalable join processing on very large RDF graphs. In: Proceedings of the 35th SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, pp. 627–640. ACM, New York (2009)CrossRefGoogle Scholar
  14. 14.
    Prud’hommeaux, E., Seaborne, A.: SPARQL Query Language for RDF. W3C Recommendation (2008)Google Scholar
  15. 15.
    Stocker, M., Seaborne, A., Bernstein, A., Kiefer, C., Reynolds, D.: SPARQL basic graph pattern optimization using selectivity estimation. In: Proceeding of the 17th International Conference on World Wide Web, Beijing, China (2008)Google Scholar
  16. 16.
    Wilschut, A.N., Apers, P.M.G.: Dataflow query execution in a parallel main-memory environment. Distributed and Parallel Databases 1(1), 103–128 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Günter Ladwig
    • 1
  • Thanh Tran
    • 1
  1. 1.Institute AIFBKarlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations