Open Access Open Access  Restricted Access Subscription Access

Query Processing in DHT Based RDF Stores

Dominic Battré,
Odej Kao,

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. This paper gives an overview of the BabelPeers architecture and presents six heuristics to process queries while addressing the issue of network traffic between the peers and data locality in such a highly distributed system. The heuristics are evaluated with the Lehigh University Benchmark.

Keywords


RDF Triple Store; Query Evaluation; DHT; BabelPeers

Citation Format:
Dominic Battré, Odej Kao, "Query Processing in DHT Based RDF Stores," Journal of Internet Technology, vol. 10, no. 2 , pp. 83-93, Apr. 2009.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.




Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314　　E-mail: jit.editorial@gmail.com