Linked Data Query Processing Strategies

  • Günter Ladwig
  • Thanh Tran
Conference paper

DOI: 10.1007/978-3-642-17746-0_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6496)
Cite this paper as:
Ladwig G., Tran T. (2010) Linked Data Query Processing Strategies. In: Patel-Schneider P.F. et al. (eds) The Semantic Web – ISWC 2010. ISWC 2010. Lecture Notes in Computer Science, vol 6496. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

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