Scalable RDF triple store using summary of hashed information and Bit comparison

@article{Bae2015ScalableRT,
  title={Scalable RDF triple store using summary of hashed information and Bit comparison},
  author={Minho Bae and Hosik Park and Gibeom Lee and Junho Eum and Sangyoon Oh},
  journal={2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)},
  year={2015},
  pages={163-168}
}
In this paper, we proposed a scalable RDF triple store for massive-scale RDF data that processes the SPARQL query with many join operations in efficient manner. Graph characteristic of RDF data model hinders scalable and efficient indexing and querying over RDF triples. To address the problem, our query processing uses the pruning algorithm based on Bit… CONTINUE READING