Abstract: A novel dataspace index method for efficient processing of path query is proposed. First, an example of joining the extended inverted index was illustrated to find the reason of inefficiency. Then, based on the extended inverted index, a B-tree index was built to efficiently search massive data. Furthermore, a secondary index was constructed in order to significantly reduce the number of repetitive comparisons with respect to index join process. Finally, a path query algorithm was presented based on the proposed dataspace index method. Experimental results show that the proposed method can not only efficiently deal with the problem of index join, but also significantly improve the performance of the path query in the dataspace.

Key words: computer software, dataspace index, auxiliary index, index join, path query