초록

용어보기논문에서 용어와 풀이말을 자동 추출한 결과로, 시범 서비스 중입니다. AI-Helper

Abstract ▼ AI-Helper

A path query is used in XML. Several index structures have been studied for processing the path query efficiently. In recent. the index schemes using suffix tree with structure join method were proposed. ViST is the most representative method among such methods. ViST processes the query using suffix...

A path query is used in XML. Several index structures have been studied for processing the path query efficiently. In recent. the index schemes using suffix tree with structure join method were proposed. ViST is the most representative method among such methods. ViST processes the query using suffix tree and uses B+-tree to reduce the search time of the documents. However, it significantly degrades the search performance when processing the path query. The reason is that it regards the element that is not ancestor-descendant relation in the document as a descendent. In this paper, we propose an efficient index structure to solve the problem of ViST. The query processing method suitable to the index structure is also proposed. It is shown through various experiments that the proposed index structure outperforms the existing index structure in terms of the query processing time.

주제어