Affiliation:
1. National Informatics Centre, New Delhi, India
Abstract
A modified version of the multiple attribute tree (MAT) database organization, which uses a compact directory, is discussed. An efficient algorithm to process the directory for carrying out the node searches is presented. Statistical procedures are developed to estimate the number of nodes searched and the number of data blocks retrieved for most general and complex queries. The performance of inverted file and modified MAT organizations are compared using six real-life databases and four types of query complexities. Careful tradeoffs are established in terms of storage and access times for directory and data, query complexities, and database characteristics.
Publisher
Association for Computing Machinery (ACM)
Reference12 articles.
1. Analysis and performance of inverted data base structures
2. Evaluation and selection of file organization—a model and system
3. Modeling and analysis of data base organization
4. GOPALAKRISHNA V. AND VENI MADHAVAN C.E. Modified multiple attribute tree data base organization--description and performance analysis. NIC Res. Rep. 2 NIC Electronics Commission New Delhi India July 1978. GOPALAKRISHNA V. AND VENI MADHAVAN C.E. Modified multiple attribute tree data base organization--description and performance analysis. NIC Res. Rep. 2 NIC Electronics Commission New Delhi India July 1978.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献