Analysis of the Multiple-Attribute-Tree Data-Base Organization
- 1 November 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-3 (6), 451-467
- https://doi.org/10.1109/tse.1977.231175
Abstract
The multiple-attribute-tree (MAT) data-base organization is modeled and analyzed. Average retrieval time per query is obtained using a statistical estimation procedure and computationally efficient cost equations are presented. These cost equations are validated using a small experimental data base. Several real-life and generated data bases are used to demonstrate the effectiveness of the multiple-attribute-tree organization in reducing the expected retrieval time per query over conventional methods.Keywords
This publication has 8 references indexed in Scilit:
- Multi-dimensional clustering for data base organizationsInformation Systems, 1977
- An attribute based model for database access cost analysisACM Transactions on Database Systems, 1977
- A dynamic database reorganization algorithmACM Transactions on Database Systems, 1976
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974
- Storage optimization of tree structured files representing descriptor setsPublished by Association for Computing Machinery (ACM) ,1971
- A formal system for information retrieval from filesCommunications of the ACM, 1970
- File Structures for On-Line SystemsPublished by Springer Nature ,1969