Performance evaluation of attribute-based tree organization
- 1 March 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 5 (1) , 69-87
- https://doi.org/10.1145/320128.320135
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- A class of hybrid list file organizationsInformation Systems, 1978
- An attribute based model for database access cost analysisACM Transactions on Database Systems, 1977
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975
- Modeling and analysis of data base organization: The doubly chained tree structureInformation Systems, 1975
- Evaluation and selection of file organization—a model and systemCommunications of the ACM, 1973
- Use of tree structures for processing filesCommunications of the ACM, 1963