Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
IEEE Internet Computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Proceedings of the 13th international conference on World Wide Web
A subscribable peer-to-peer RDF repository for distributed metadata management
Web Semantics: Science, Services and Agents on the World Wide Web
Caching of intermediate results in DHT-based RDF stores
International Journal of Metadata, Semantics and Ontologies
Towards Parallel Processing of RDF Queries in DHTs
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Matrix "Bit" loaded: a scalable lightweight join query processor for RDF data
Proceedings of the 19th international conference on World wide web
A survey of structured P2P systems for RDF data storage and retrieval
Transactions on large-scale data- and knowledge-centered systems III
Hi-index | 0.00 |
Today, RDF data/triples are scattered everywhere and their total size is rapidly increasing. Centralized RDF triple stores have limitations on both their failure tolerance and scalability. Therefore, RDF query processing in a P2P environment is an important issue. So far, several conventional P2P-based RDF triple stores have been proposed. They, however, are designed merely for triple retrieval rather than for triple join query processing. Consequently, they suffer from an unnecessary data transfer problem. This paper presents an RDF query processing technique based on a three-dimensional hash index. The triples are mapped into the index; then bit information that represents the presence or absence of triples in the index is introduced. We implemented our approach on the top of an emulated P2P environment. Evaluation results show that our approach can achieve good performance and scalability.