Analysis of the Multiple-Attribute-Tree Data-Base Organization

Authors:
R. L. Kashyap;S. K. C. Subas;S. B. Yao
Affiliations:
School of Electrical Engineering, Purdue University;-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1977

Citing 0
Cited 3

Storage mappings for multidimensional linear dynamic hashing

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Multidimensional Height-Balanced Trees

IEEE Transactions on Computers
Multi-attribute lexicon generation hyperlinked embedded access structure

IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium

Quantified Score

Hi-index	0.01

Visualization

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.