The partial-order tree: a new structure for indexing on complex attributes in object-oriented databases
The partial-order tree: a new structure for indexing on complex attributes in object-oriented databases
复制标题
DOI：
10.1109/eurmic.1997.617215
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
K. Goczyła
中科院分区：
文献类型：
--
作者：
K. Goczyła
本文主要研究对象管理系统中属性的非原语（复杂）值的索引问题。提出了一种新的集（多值）属性索引结构。该结构基于对索引属性的值施加的部分顺序，这些值是一组原始值的子集。结果表明，所提出的索引允许系统有效地执行在对象查询语言中假定应用的典型集合操作符（is-equal、is-子集、is-superset），而无需在传统索引结构中必要的对象标识符列表上执行任何昂贵的操作。描述了一种新的索引结构，称为偏序树，并概述了执行集合运算符的算法。
The paper focuses on the indexing of non-primitive (complex) values of attributes in an object management system. A new index structure for indexing on set (multivalued) attributes is proposed. This structure is based on a partial order imposed on the values of the indexed attribute, which are subsets of a set of primitive values. It is shown that the proposed index allows the system to efficiently perform typical set operators that are postulated to be applied in object query languages (is-equal, is-subset, is-superset), without performing any costly operations on lists of object identifiers that would be necessary in traditional index structures. The new index structure, called partial-order tree, is described and algorithms performing the set operators are outlined.