Efficient searching in large inheritance hierarchies

Authors:
Michal Krátký;Svatopluk Štolfa;Václav Snášel;Ivo Vondrák
Affiliations:
Department of Computer Science, VŠB – Technical University of Ostrava, Ostrava–Poruba, Czech Republic;Department of Computer Science, VŠB – Technical University of Ostrava, Ostrava–Poruba, Czech Republic;Department of Computer Science, VŠB – Technical University of Ostrava, Ostrava–Poruba, Czech Republic;Department of Computer Science, VŠB – Technical University of Ostrava, Ostrava–Poruba, Czech Republic
Venue:
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Year:
2005

Citing 16
Cited 2

Algorithms & data structures

Algorithms & data structures
Indexing techniques for object-oriented databases

Object-oriented concepts, databases, and applications
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Object-oriented modeling and design

Object-oriented modeling and design
Efficient handling of multiple inheritance hierarchies

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
OODB indexing by class-division

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Triple-node hierarchies for object-oriented database indexing

Proceedings of the seventh international conference on Information and knowledge management
Definition and analysis of index organizations for object-oriented database systems

Information Systems
Advanced database indexing

Advanced database indexing
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Indexing Multiple Sets

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 Universal B-Tree for Multidimensional Indexing: general Concepts

WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
A Quasi Optimal Bit-Vector Encoding of Tree Hierarchies. Application to Efficient Type Inclusion Tests

ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
A configurable type hierarchy index for OODB

The VLDB Journal — The International Journal on Very Large Data Bases
Implementation of XPath axes in the multi-dimensional approach to indexing XML data

EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology

Dynamic method materialization: a framework for optimizing data access via methods

DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
PMAP: framework to predicting method access patterns for materialized methods

ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inheritance hierarchies have become more and more complex according to an enlargement of object-oriented technology. One of the main problems is the effective searching in such hierarchies. More sophisticated algorithms are needed to searching in the data. In this article we present a novel approach to efficient searching in large inheritance hierarchies. The updatable approach employs the multi-dimensional data structures to indexing inheritance hierarchies and effective searching in the data.