Access support relations: an indexing method for object bases
Information Systems - Data bases: their creation, management, and utilization
Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
S-tree: a dynamic balanced signature index for office retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
The object database standard: ODMG 2.0
The object database standard: ODMG 2.0
Indexing in an object-oriented DBMS
OODS '86 Proceedings on the 1986 international workshop on Object-oriented database systems
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Improved methods for signature-tree construction
The Computer Journal
Object Relational DBMSs: The Next Great Wave
Object Relational DBMSs: The Next Great Wave
Signature-based structures for objects with set-valued attributes
Information Systems - Databases: Creation, management and utilization
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and Data Engineering
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A performance study of four index structures for set-valued attributes of low cardinality
The VLDB Journal — The International Journal on Very Large Data Bases
Linear hashing with partial expansions
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
| Hi-index | 0.00 |
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and thus generates a much smaller number of subqueries for query sets (so far fast-growing directories have prohibited hash-based index structures for set-valued retrieval). We demonstrate the advantages of our scheme over regular extendible hashing both analytically and experimentally. We also implemented a prototype and briefly summarize the results of our experimental evaluation.