This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of the Multiple-Attribute-Tree Data-Base Organization
November 1977 (vol. 3 no. 6)
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.
Index Terms:
query statistics, Average retrieval time per query, data-base organization, data base performance, directory search time, multiple attribute tree, secondary index organization
Citation:
R.L. Kashyap, S.K.C. Subas, S.B. Yao, "Analysis of the Multiple-Attribute-Tree Data-Base Organization," IEEE Transactions on Software Engineering, vol. 3, no. 6, pp. 451-467, Nov. 1977, doi:10.1109/TSE.1977.231175
Usage of this product signifies your acceptance of the Terms of Use.