Analysis of the Multiple-Attribute-Tree Data-Base Organization
R.L. Kashyap, Sukumaran K. C Subas, S. Bing Yao · IEEE Transactions on Software Engineering · 1977
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.