Query Planning in DHT Based RDF Stores

Author

Battr, Dominic

Author_Institution

Tech. Univ. Berlin, Berlin, Germany

fYear

2008

fDate

Nov. 30 2008-Dec. 3 2008

Firstpage

187

Lastpage

194

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.

Keywords

electronic data interchange; meta data; query processing; semantic Web; telecommunication traffic; DHT; Lehigh University Benchmark; RDF triple store; centralized database; distributed hash table; message latency; network traffic; query planning; resource description framework; Databases; Delay; Filters; Internet; Peer to peer computing; Process planning; Query processing; Resource description framework; Signal processing; Telecommunication traffic; BabelPeers; DHT; RDF triple store; query evaluation; query planning;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Image Technology and Internet Based Systems, 2008. SITIS '08. IEEE International Conference on

Conference_Location

Bali

Print_ISBN

978-0-7695-3493-0

Type

conf

DOI

10.1109/SITIS.2008.15

Filename

4725803