The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Analysis and performance of inverted data base structures
Communications of the ACM
Evaluation and selection of file organization—a model and system
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
| Hi-index | 0.00 |
A modified version of the multiple attribute tree (MAT) database organization, which uses a compact directory, is discussed. An efficient algorithm to process the directory for carrying out the node searches is presented. Statistical procedures are developed to estimate the number of nodes searched and the number of data blocks retrieved for most general and complex queries. The performance of inverted file and modified MAT organizations are compared using six real-life databases and four types of query complexities. Careful tradeoffs are established in terms of storage and access times for directory and data, query complexities, and database characteristics.