PERFORMANCE ANALYSIS AND COMPARISON FOR LINKED DATA INDEX STRUCTURE
With the development of semantic web and the rapid growth of data volume of RDF, the storage and retrieval of the large-scale RDF data have become a research hotspot. Therefore, it is an important issue how to the large-scale RDF data are stored, indexed, and queried. In this paper, we present a solution to store and query the large-scale RDF data by k-d tree and -tree, and analyze the strength and weakness of both techniques. We also propose an optimized scheme focus on the join query for adapting -tree.
k-d tree, R*-tree, linked data, RDF, SPARQL, semantic web, DBpedia.