ACM SIGMOD Anthology TODS dblp.uni-trier.de

Performance Evaluation of Attribute-Based Tree Organization.

V. Gopalakrishna, C. E. Veni Madhavan: Performance Evaluation of Attribute-Based Tree Organization. ACM Trans. Database Syst. 5(1): 69-87(1980)
@article{DBLP:journals/tods/GopalakrishnaM80,
  author    = {V. Gopalakrishna and
               C. E. Veni Madhavan},
  title     = {Performance Evaluation of Attribute-Based Tree Organization},
  journal   = {ACM Trans. Database Syst.},
  volume    = {5},
  number    = {1},
  year      = {1980},
  pages     = {69-87},
  ee        = {http://doi.acm.org/10.1145/320128.320135, db/journals/tods/GopalakrishnaM80.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

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 moditied 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.

Copyright © 1980 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[1]
Alfonso F. Cardenas: Analysis and Performance of Inverted Data Base Structures. Commun. ACM 18(5): 253-263(1975) BibTeX
[2]
Alfonso F. Cardenas: Evaluation and Selection of File Organization - A Model and System. Commun. ACM 16(9): 540-548(1973) BibTeX
[3]
Alfonso F. Cardenas, James P. Sagamang: Modeling and analysis of data base organization. The doubly chained tree structure. Inf. Syst. 1(2): 57-67(1975) BibTeX
[4]
...
[5]
...
[6]
Rangasami L. Kashyap, S. K. C. Subas, S. Bing Yao: Analysis of the Multiple-Attribute-Tree Data-Base Organization. IEEE Trans. Software Eng. 3(6): 451-467(1977) BibTeX
[7]
Donald E. Knuth: The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley 1973
BibTeX
[8]
J. H. Liou, S. Bing Yao: Multi-dimensional clustering for data base organizations. Inf. Syst. 2(4): 187-198(1977) BibTeX
[9]
Theodore Rotwitt Jr., Paul A. D. de Maine: Storage Optimization of Tree Structured Files. SIGFIDET Workshop 1971: 207-217 BibTeX
[10]
Edward H. Sussenguth Jr.: Use of Tree Structures for Processing Files. Commun. ACM 6(5): 272-279(1963) BibTeX
[11]
Chung-Shu Yang: A class of hybrid list file organizations. Inf. Syst. 3(1): 49-58(1978) BibTeX
[12]
S. Bing Yao: An Attribute Based Model for Database Access Cost Analysis. ACM Trans. Database Syst. 2(1): 45-67(1977) BibTeX

Referenced by

  1. Jack A. Orenstein, T. H. Merrett: A Class of Data Structures for Associative Searching. PODS 1984: 181-190
  2. Kenneth C. Sevcik: Data Base System Performance Prediction Using an Analytical Model (Invited Paper). VLDB 1981: 182-198
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:42 2008