Paper Info
Title
Caching of intermediate results in DHT-based RDF stores
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.
Year
DOI
Venue
2008
10.1504/IJMSO.2008.021207
IJMSO
Keywords
DocType
Volume
cached intermediate result,online query,DHT-based RDF store,RDF data,Hash Table,previous query,RDF store,efficient query evaluation,query shipping,intermediate result,decentralised approach
Journal
3
Issue
Citations 
PageRank 
1
2
0.36
References 
Authors
14
1
Name
Order
Citations
PageRank
Dominic Battré125720.40