Evaluating Conjunctive Triple Pattern Queries over Large Structured Overlay Networks^*

Erietta Liarou¹, Stratos Idreos², and Manolis Koubarakis³

¹Technical University of Crete, Chania, Greece

²CWI, Amsterdam, The Netherlands

³National and Kapodistrian University of Athens, Athens, Greece

Abstract. We study the problem of evaluating conjunctive queries composed of triple patterns over RDF data stored in distributed hash tables. Our goal is to develop algorithms that scale to large amounts of RDF data, distribute the query processing load evenly and incur little network traffic. We present and evaluate two novel query processing algorithms with these possibly conflicting goals in mind. We discuss the various tradeoffs that occur in our setting through a detailed experimental evaluation of the proposed algorithms.

^*This work was supported in part by the European Commission project Ontogrid (http://www.ontogrid.net/).

LNCS 4273, p. 399 ff.

Full article in PDF | BibTeX

lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2006