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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Liarou, E., Idreos, S., & Koubarakis, M. (2006). Evaluating conjunctive triple pattern queries over large structured overlay networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4273 LNCS, pp. 399–413). Springer Verlag. https://doi.org/10.1007/11926078_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
