The Semantic Web pp 324-339

Continuous RDF Query Processing over DHTs

  • Erietta Liarou
  • Stratos Idreos
  • Manolis Koubarakis
Conference paper

DOI: 10.1007/978-3-540-76298-0_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4825)
Cite this paper as:
Liarou E., Idreos S., Koubarakis M. (2007) Continuous RDF Query Processing over DHTs. In: Aberer K. et al. (eds) The Semantic Web. Lecture Notes in Computer Science, vol 4825. Springer, Berlin, Heidelberg

Abstract

We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long-standing queries and receive answers whenever RDF triples satisfying their queries are published. We present two novel query processing algorithms for this scenario and analyze their properties formally. Our performance goal is to have algorithms that scale to large amounts of RDF data, distribute the storage and query processing load evenly and incur as little network traffic as possible. We discuss the various performance tradeoffs that occur through a detailed experimental evaluation of the proposed algorithms.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Erietta Liarou
    • 1
  • Stratos Idreos
    • 1
  • Manolis Koubarakis
    • 2
  1. 1.CWI, AmsterdamThe Netherlands
  2. 2.National and Kapodistrian University of Athens, AthensGreece

Personalised recommendations