Indexing techniques for object-oriented databases
Object-oriented concepts, databases, and applications
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
H-trees: a dynamic associative search index for OODB
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Joint ACM SIGMOD Intl Conference on Management of Data and ACM SIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
OODB indexing by class-division
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Multidimensional binary search trees used for associative searching
Communications of the ACM
Index Data Structures in Object-Oriented Databases
Index Data Structures in Object-Oriented Databases
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database Systems
Indexing OODB Instances based on Access Proximity
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
The Multikey Type Index for Persistent Object Sets
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
An Indexing Technique for Object-Oriented Databases
Proceedings of the Seventh International Conference on Data Engineering
A Uniform Indexing Scheme for Object-Oriented Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A Graph-Theoretic Approach to Indexing in Object-Oriented Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The hcC-tree: An Efficient Index Structure for Object Oriented Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Index nesting – an efficient approach to indexing in object-oriented databases
The VLDB Journal — The International Journal on Very Large Data Bases
SaveMe: a system for archiving electronic documents using messaging groupware
WACC '99 Proceedings of the international joint conference on Work activities coordination and collaboration
2D-CHI: A Tunable Two-Dimensional Class Hierarchy Index for Object-Oriented Databases
COMPSAC '00 24th International Computer Software and Applications Conference
The building of BODHI, a bio-diversity database system
Information Systems - Special issue: Data management in bioinformatics
Efficient searching in large inheritance hierarchies
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Generalized Hybrid Encoding of Polyhierarchical Structures
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.03 |
With respect to the specific requirements of advanced OODB applications, index data structures for type hierarchies in OODBMS have to provide efficient support for multiattribute queries and have to allow index optimization for a particular query profile. We describe the multikey type index and an efficient implementation of this indexing scheme. It meets both requirements: in addition to its multiattribute query capabilities it is designed as a mediator between two standard design alternatives, key-grouping and type-grouping. A prerequisite for the multikey type index is a linearization algorithm which maps type hierarchies to linearly ordered attribute domains in such a way that each subhierarchy is represented by an interval of this domain. The algorithm extends previous results with respect to multiple inheritance. The subsequent evaluation of our proposal focuses on storage space overhead as well as on the number of disk I/O operations needed for query execution. The analytical results for the multikey type index are compared to previously published figures for well-known single-key search structures. The comparison clearly shows the superiority of the multikey type index for a large class of query profiles.