Title: Caching of intermediate results in DHT-based RDF stores
Authors: Dominic Battre
Addresses: Technische Universitat Berlin, Secr. E-N 50, Einsteinufer 17, 10587 Berlin, Germany
Abstract: In the recent past, several peer-to-peer based RDF stores have emerged in order to cope with large amounts of RDF data that are queried by many clients concurrently. Efficient query evaluation is a central issue in order to exploit the benefits of such a decentralised approach. This paper shows how caching of intermediate results can significantly reduce the utilisation of network communication, which is currently among the most serious bottlenecks of Distributed Hash Table (DHT)-based RDF stores. The approach presented uses a combination of query shipping and online query planning to follow paths of cached intermediate results from previous queries.
Keywords: caching; intermediate results; RDF data; triple stores; peer-to-peer; DHT; distributed hash table; query evaluation; network communication; query shipping; online query planning; semantic web.
DOI: 10.1504/IJMSO.2008.021207
International Journal of Metadata, Semantics and Ontologies, 2008 Vol.3 No.1, pp.84 - 93
Published online: 10 Nov 2008 *
Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article