내포 질의의 효율적 평가를 위한 분리 색인 기법

A Separated Indexing Technique for Efficient Evaluation of Nested Queries

  • 권영무 (한양대학교 전자공학과) ;
  • 박용진 (한양대학교 전자공학과)
  • 발행 : 1992.07.01

초록

In this paper, a new indexing technique is proposed for efficient evaluation of nested queries on aggregation hierarchy in object-oriented data model. As an index data structure, an extended $B^{+}$ tree is introduced in which instance identifier to be searched and path information used for update of index record are stored in leaf node and subleaf node, respectively. the retrieval and update algorithm on the introduced index data structure is provided. Comparisons under a variety of conditions are given with current indexing techniques, showing improved performance in cost, i.e., the total number of pages accessed for retrieval and update.

키워드