%0 Journal Article %1 akiyoshi2007rdfcube %A Matono, Akiyoshi %A Pahlevi, Said %A Kojima, Isao %D 2007 %J Databases, Information Systems, and Peer-to-Peer Computing %K DHT distributed hash hypercube index triple-store %P 323--330 %T RDFCube: A P2P-Based Three-Dimensional Index for Structural Joins on Distributed Triple Stores %U http://dx.doi.org/10.1007/978-3-540-71661-7_31 %X 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 isan important issue. So far, several conventional P2P-based RDF triple stores have been proposed. They, however, are designedmerely for triple retrieval rather than for triple join query processing. Consequently, they suffer from an unnecessary datatransfer problem. This paper presents an RDF query processing technique based on a three-dimensional hash index. The triplesare 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 achievegood performance and scalability.

@article{akiyoshi2007rdfcube, abstract = {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 isan important issue. So far, several conventional P2P-based RDF triple stores have been proposed. They, however, are designedmerely for triple retrieval rather than for triple join query processing. Consequently, they suffer from an unnecessary datatransfer problem. This paper presents an RDF query processing technique based on a three-dimensional hash index. The triplesare 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 achievegood performance and scalability.}, added-at = {2009-10-14T13:06:42.000+0200}, author = {Matono, Akiyoshi and Pahlevi, Said and Kojima, Isao}, biburl = {https://www.bibsonomy.org/bibtex/2648f959ec41bf1aff062692ccbd8e9c1/brightbyte}, description = {SpringerLink - Book Chapter}, interhash = {6b880d8c57718580f5cc9d3fed90bc26}, intrahash = {648f959ec41bf1aff062692ccbd8e9c1}, journal = {Databases, Information Systems, and Peer-to-Peer Computing}, keywords = {DHT distributed hash hypercube index triple-store}, pages = {323--330}, timestamp = {2009-10-14T13:06:42.000+0200}, title = {RDFCube: A P2P-Based Three-Dimensional Index for Structural Joins on Distributed Triple Stores}, url = {http://dx.doi.org/10.1007/978-3-540-71661-7_31}, year = 2007 }