Continuous RDF Query Processing over DHTs

Presented at: 6th International and 2nd Asian Semantic Web Conference (ISWC2007+ASWC2007)

by Erietta Liarou, Stratos Idreos, Manolis Koubarakis

Webpage: http://data.semanticweb.org/pdfs/iswc-aswc/2007/ISWC2007_RT_Liarou.pdf

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.

Continuous RDF Query Processing over DHTs was presented at this event.

Keywords: Data management, Grid computing, Grid Computing, Peer-to-peer, Semantic Web


Resource URI on the dog food server: http://data.semanticweb.org/conference/iswc-aswc/2007/tracks/research/papers/323
Same as: http://revyu.com/things/iswc-aswc-2007-research-paper-323-continuous-rdf


Explore this resource elsewhere: