The Community for Technology Leaders
Green Image
Issue No. 06 - November (1977 vol. 3)
ISSN: 0098-5589
pp: 451-467
R.L. Kashyap , School of Electrical Engineering, Purdue University
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.
query statistics, Average retrieval time per query, data-base organization, data base performance, directory search time, multiple attribute tree, secondary index organization

S. Subas, S. Yao and R. Kashyap, "Analysis of the Multiple-Attribute-Tree Data-Base Organization," in IEEE Transactions on Software Engineering, vol. 3, no. , pp. 451-467, 1977.
86 ms
(Ver 3.3 (11022016))