DocumentCode
748711
Title
Analysis of the Multiple-Attribute-Tree Data-Base Organization
Author
Kashyap, R.L. ; Subas, S.K.C. ; Yao, S. Bing
Author_Institution
School of Electrical Engineering, Purdue University
Issue
6
fYear
1977
Firstpage
451
Lastpage
467
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
Average retrieval time per query; data base performance; data-base organization; directory search time; multiple attribute tree; query statistics; secondary index organization; Computational efficiency; Computational modeling; Costs; Discrete cosine transforms; Equations; Information retrieval; Military computing; Physics; Statistical analysis; Statistics; Average retrieval time per query; data base performance; data-base organization; directory search time; multiple attribute tree; query statistics; secondary index organization;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1977.231175
Filename
1702474
Link To Document