The algorithm design manual
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Data Indexing in Peer-to-Peer DHT Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
Processing complex RDF queries over P2P networks
Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks
Scalable p2p based RDF querying
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Distributed cache table: efficient query-driven processing of multi-term queries in P2P networks
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Semantic caching in schema-based P2P-networks
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
RDFCube: a P2P-based three-dimensional index for structural joins on distributed triple stores
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
On triple dissemination, forward-chaining, and load balancing in DHT based RDF stores
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Evaluating conjunctive triple pattern queries over large structured overlay networks
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Top k RDF query evaluation in structured P2P networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A social web platform based on semantics to share exam questions: the SOLE approach
International Journal of Technology Enhanced Learning
A survey of structured P2P systems for RDF data storage and retrieval
Transactions on large-scale data- and knowledge-centered systems III
Evaluation of RDF queries via equivalence
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
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.