Index Structure and Algorithm for Path-based RDF Query

Efficient processing of the queries on RDF data is one of the most important topics in RDF data management. To handle path-based query, Matono et al. proposed an index structure using suffix array. However they considered only the basic path expression in which it has the fixed length and there is no omitted component. In addition, they maintain the whole suffix labels in the single suffix array. If the size of RDF graph is increased the search scape to the suffix array is also increased. In this paper, we first modify Matono’s scheme to reduce the search space over index structure. Next we propose an query processing algorithm to handle some types of RDF queries not covered previously.