Caching of intermediate results in DHT-based RDF stores
by Dominic Battre
International Journal of Metadata, Semantics and Ontologies (IJMSO), Vol. 3, No. 1, 2008

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.

Online publication date: Mon, 10-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metadata, Semantics and Ontologies (IJMSO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com