ACM SIGMOD Anthology VLDB dblp.uni-trier.de

An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme.

Toshiyuki Nakamura, Tetsuo Mizoguchi: An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme. VLDB 1978: 489-495
@inproceedings{DBLP:conf/vldb/NakamuraM78,
  author    = {Toshiyuki Nakamura and
               Tetsuo Mizoguchi},
  editor    = {S. Bing Yao},
  title     = {An Analysis of Storage Utilization Factor in Block Split Data
               Structuring Scheme},
  booktitle = {Fourth International Conference on Very Large Data Bases, September
               13-15, 1978, West Berlin, Germany},
  publisher = {IEEE Computer Society},
  year      = {1978},
  pages     = {489-495},
  ee        = {db/conf/vldb/NakamuraM78.html},
  crossref  = {DBLP:conf/vldb/78},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

The Storage Utilization Factor (SUF) of Block Split Data Structuring (BSDS) scheme (e.g.IBM's VSAM) is analyzed in this paper. We analyze SUF in both cases of light input after arbitrary initial loading and heavy inputvolume at initial loading. It is shown that expected SUF for sufficiently large number of inputs and large size of data block is ln2= 69.31% and SUF distribution is fairly sharp. SUF fluctuation in light input after given initial loading increases as block size is increased. We also present a variation of BSDS to improve SUF by 13%. Some experimental results indicate that the analysis of expected SUF is sufficiently adequate.

Copyright © 1978 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

S. Bing Yao (Ed.): Fourth International Conference on Very Large Data Bases, September 13-15, 1978, West Berlin, Germany. IEEE Computer Society 1978
Contents BibTeX

References

[1]
...
[2]
Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

Referenced by

  1. June S. Park, V. Sridhar: Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering. IEEE Trans. Knowl. Data Eng. 9(5): 826-832(1997)
  2. Ricardo A. Baeza-Yates, Per-Åke Larson: Performance of B+-Trees with Partial Expansions. IEEE Trans. Knowl. Data Eng. 1(2): 248-257(1989)
  3. Don S. Batory: Modeling the Storage Architectures of Commercial Database Systems. ACM Trans. Database Syst. 10(4): 463-528(1985)
  4. Don S. Batory, C. C. Gotlieb: A Unifying Model of Physical Databases. ACM Trans. Database Syst. 7(4): 509-539(1982)
  5. Don S. Batory: Optimal File Designs and Reorganization Points. ACM Trans. Database Syst. 7(1): 60-81(1982)
  6. Michel Scholl: New File Organizations Based on Dynamic Hashing. ACM Trans. Database Syst. 6(1): 194-211(1981)
  7. Per-Åke Larson: Analysis of Index-Sequential Files with Overflow Chaining. ACM Trans. Database Syst. 6(4): 671-680(1981)
  8. Kenneth C. Sevcik: Data Base System Performance Prediction Using an Analytical Model (Invited Paper). VLDB 1981: 182-198
  9. Don S. Batory: B+ Trees and Indexed Sequential Files: A Performance Comparison. SIGMOD Conference 1981: 30-39
  10. Ehud Gudes, Shalom Tsur: Experiments with B-Tree Reorganization. SIGMOD Conference 1980: 200-206
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
VLDB Proceedings (1977-1981): Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:45:04 2009