Query Planning in DHT Based RDF Stores

Authors:
Dominic Battré
Affiliations:
-
Venue:
SITIS '08 Proceedings of the 2008 IEEE International Conference on Signal Image Technology and Internet Based Systems
Year:
2008

Citing 0
Cited 3

Towards Parallel Processing of RDF Queries in DHTs

Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
A survey of structured P2P systems for RDF data storage and retrieval

Transactions on large-scale data- and knowledge-centered systems III
Scalable distributed indexing and query processing over Linked Data

Web Semantics: Science, Services and Agents on the World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Implementing scalable RDF triple stores that can store many triples and process many queries concurrently is challenging. Several projects have investigated the use of distributed hash tables for this task but query planning has received little attention in this context so far. Given the distributed nature of DHTs, latencies of messages and limited network bandwidth are crucial factors to consider. Also due to a lack of global knowledge in DHTs, query planning is different from centralized databases. This paper discusses a set of heuristics and evaluates their performance on the Lehigh University Benchmark with emphasis on the network traffic. The results show the importance of query planning in DHT based RDF triple stores.