面向对象数据库系统中有序集合的索引技术

AN INDEXING TECHNIQUE FOR ORDERED SETS IN OBJECT-ORIENTED DATABASE SYSTEMS

本文首先讨论了面向对象数据库系统中的索引技术，分析了传统的基于值的索引技术不适合于用来索引有序集合的原因，然后提出了一种新的适合于有序集合的索引机制──P＋树．同时本文也设计了一个用于测试有序集合索引机制的评价基准，根据该测试基准对本文提出的索引机制进行了系统的分析与评价.

This paper first discusses the existing techniques for indexing object-oriented databases and analyzes the reasons that the traditional indexing techniques based on values are not suitable for indexing ordered sets. And then a new indexing mechanism, called P+ tree, is presented for Indexing ordered sets in object-oriented database systems. In order to test the performance of indexing ordered sets, a benchmark is proposed with which the indexing mechanism presented in the paper is analyzed and evaluated.