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
ASCII Text
x 
 
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, November, 1977.
 
 
BibTex
x
 
@article{ 10.1109/TSE.1977.231175,
author = {R.L. Kashyap and S.K.C. Subas and S.B. Yao},
title = {Analysis of the Multiple-Attribute-Tree Data-Base Organization},
journal ={IEEE Transactions on Software Engineering},
volume = {3},
number = {6},
issn = {0098-5589},
year = {1977},
pages = {451-467},
doi = {http://doi.ieeecomputersociety.org/10.1109/TSE.1977.231175},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Software Engineering
TI - Analysis of the Multiple-Attribute-Tree Data-Base Organization
IS - 6
SN - 0098-5589
SP451
EP467
EPD - 451-467
A1 - R.L. Kashyap,
A1 - S.K.C. Subas,
A1 - S.B. Yao,
PY - 1977
KW - query statistics
KW - Average retrieval time per query
KW - data-base organization
KW - data base performance
KW - directory search time
KW - multiple attribute tree
KW - secondary index organization
VL - 3
JA - IEEE Transactions on Software Engineering
ER -
 
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.