Rainbow: A distributed and hierarchical RDF triple store with dynamic scalability


In the Big Data era, the ever-increasing RDF data have reached a scale in billions of triples and brought obstacles and challenges to single-node RDF data stores. As a result, many distributed RDF stores have been emerging in the Semantic Web community recently. However, currently published ones are either not enough efficient on performance or failed to achieve flexible scalability. In this paper, we propose Rainbow, a scalable and efficient RDF triple store. The RDF data indexing scheme in Rainbow is a hybrid one which is designed based on the statistical analysis of user query space. Further, to better support the hybrid indexing scheme, Rainbow adopts a distributed and hierarchical storage architecture that uses HBase as the scalable persistent storage and combines a distributed memory storage to speedup query performance. The RDF data in memory storage is partitioned by the consistent hashing algorithm to achieve the dynamic scalability. Experiments show that Rainbow outperforms typical existing distributed RDF triple stores, with excellent scalability and fault tolerance.

DOI: 10.1109/BigData.2014.7004274

Extracted Key Phrases

11 Figures and Tables

Cite this paper

@article{Gu2014RainbowAD, title={Rainbow: A distributed and hierarchical RDF triple store with dynamic scalability}, author={Rong Gu and Wei Hu and Yihua Huang}, journal={2014 IEEE International Conference on Big Data (Big Data)}, year={2014}, pages={561-566} }