Paper Info
Title
Query Planning in DHT Based RDF Stores
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.
Year
DOI
Venue
2008
10.1109/SITIS.2008.15
SITIS
Keywords
Field
DocType
query planning,crucial factor,rdf stores,hash table,global knowledge,lehigh university benchmark,scalable rdf triple store,network traffic,centralized databases,limited network bandwidth,rdf triple store,planning,distributed hash table,meta data,electronic data interchange,resource description framework,pattern matching,semantic web,matched filters,databases
RDF query language,Centralized database,Computer science,SPARQL,Heuristics,Hash function,RDF,Database,Hash table,Distributed hash table
Conference
Volume
Issue
ISSN
10
2
1607-9264
Citations 
PageRank 
References 
4
0.39
38
Authors
2
Name
Order
Citations
PageRank
Dominic Battré125720.40
Odej Kao2106696.19