Evaluating Conjunctive Triple Pattern Queries over Large Structured Overlay Networks

From semanticweb.org

Jump to: navigation, search

A paper written by Erietta Liarou, Stratos Idreos and Manolis Koubarakis. It was presented at the ISWC2006.

[edit] 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.

The schedule for this talk can be found in the conference programme and a linked list of all talks is provided in the article on ISWC2006 papers. This article has originally been created from the RDF metadata for ISWC 2006.

Retrieved from "http://semanticweb.org/wiki/Evaluating_Conjunctive_Triple_Pattern_Queries_over_Large_Structured_Overlay_Networks"
Personal tools