Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Object-oriented concepts, databases, and applications
Object-oriented concepts, databases, and applications
Indexing techniques for object-oriented databases
Object-oriented concepts, databases, and applications
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Maintaining range trees in secondary memory. Part I: partitions
Acta Informatica
Maintaining range trees in secondary memory. Part II: lower bounds
Acta Informatica
Readings in object-oriented database systems
Readings in object-oriented database systems
Access support in object bases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
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
Building an object-oriented database system: the story of 02
Building an object-oriented database system: the story of 02
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
Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Indexing for data models with classes and constraints
Indexing for data models with classes and constraints
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Indexing in an object-oriented DBMS
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and Data Engineering
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proceedings of the Fifth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
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
OODB Indexing by Class-Division
OODB Indexing by Class-Division
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Triple-node hierarchies for object-oriented database indexing
Proceedings of the seventh international conference on Information and knowledge management
SaveMe: a system for archiving electronic documents using messaging groupware
WACC '99 Proceedings of the international joint conference on Work activities coordination and collaboration
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Join Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
2D-CHI: A Tunable Two-Dimensional Class Hierarchy Index for Object-Oriented Databases
COMPSAC '00 24th International Computer Software and Applications Conference
A configurable type hierarchy index for OODB
The VLDB Journal — The International Journal on Very Large Data Bases
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Energy-Efficient Indexing on a Broadcast Channel in a Mobile Database Access System
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Efficient searching in large inheritance hierarchies
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
Indexing a class hierarchy, in order to efficiently search or update the objects of a class according to a (range of) value(s) of an attribute, impacts OODB performance heavily. For this indexing problem, most systems use the class hierarchy index (CH) technique of [15] implemented using B+-trees. Other techniques, such as those of [14, 18,31], can lead to improved average-case performance but involve the implementation of new data-structures. As a special form of external dynamic two-dimensional range searching, this OODB indexing problem is solvable within reasonable worst-case bounds [12]. Based on this insight, we have developed a technique, called indexing by class-division (CD), which we believe can be used as a practical alternative to CH. We present an optimized implementation and experimental validation of CD's average-case performance. The main advantages of the CD technique are: (1) CD is an extension of CH that provides a significant speed-up over CH for a wide spectrum of range queries--this speed-up is at least linear in the number of classes queried for uniform data and larger otherwise; and (2) CD queries, updates and concurrent use are implementable using existing B+-tree technology. The basic idea of class-division involves a time-space tradeoff and CD requires some space and update overhead in comparison to CH. In practice, this overhead is a small factor (2 to 3) and, in worst-case, is bounded by the depth of the hierarchy and the logarithm of its size.