Abstract
In this paper a high performance storage system for RDF documents is introduced. The system employs optimized index structures for RDF data and efficient RDF query evaluation. The index scheme consists of 3 types of indices. Triple index manages basic RDF triples by dividing original RDF graph into several sub-graphs. Path index manages frequent RDF path patterns for long path query performance enhancement. Context index is optional for context oriented RDF data and temporal RDF data. In this paper, we describe the organization of index structures, show the process of evaluating queries based on the index structures, and provide a performance comparison with exist RDF databases through several benchmark experiments. © IFIP International Federation for Information Processing 2007.
Cite
CITATION STYLE
Baolin, L., & Bo, H. (2007). HPRD: A high performance RDF database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4672 LNCS, pp. 364–374). Springer Verlag. https://doi.org/10.1007/978-3-540-74784-0_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
