Optimum Data Base Reorganization Points.

Ben Shneiderman: Optimum Data Base Reorganization Points. Commun. ACM 16(6): 362-365(1973)
  author    = {Ben Shneiderman},
  title     = {Optimum Data Base Reorganization Points},
  journal   = {Commun. ACM},
  volume    = {16},
  number    = {6},
  year      = {1973},
  pages     = {362-365},
  ee        = {db/journals/cacm/Shneiderman73.html},
  bibsource = {DBLP,}


Copyright © 1973 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.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 4 Issue 1, Books, VLDB-j, TODS, ..." and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

Online Edition: ACM Digital Library

Referenced by

  1. Peter Zabback, Ibrahim H. Önyüksel, Peter Scheuermann, Gerhard Weikum: Database Reorganization in Parallel Disk Arrays with I/O Service Stealing. IEEE Trans. Knowl. Data Eng. 10(5): 855-858(1998)
  2. Yannis Manolopoulos, John G. Kollias: Performance of a Two-Headed Disk System when Serving Database Queries Under the Scan Policy. ACM Trans. Database Syst. 14(3): 425-442(1989)
  3. George P. Copeland, William Alexander, Ellen E. Boughter, Tom W. Keller: Data Placement In Bubba. SIGMOD Conference 1988: 99-108
  4. T. S. Yuen, H. C. Du: Dynamic File Organizations For Partial Match Retrieval Based on Linear Hashing. ICDE 1986: 116-123
  5. Sheau-Dong Lang, James R. Driscoll, Jiann H. Jou: Improving the Differential File Technique via Batch Operations for Tree Structured File Organizations. ICDE 1986: 524-532
  6. Clement T. Yu, C. H. Chen: Adaptive Information System Design: One Query at a Time. SIGMOD Conference 1985: 280-290
  7. Daniel P. Heyman: Mathematical Models of Database Degradation. ACM Trans. Database Syst. 7(4): 615-631(1982)
  8. Don S. Batory: Optimal File Designs and Reorganization Points. ACM Trans. Database Syst. 7(1): 60-81(1982)
  9. Lars Söderlund: Concurrent Data Base Reorganization - Assessment of a Powerful Technique through Modeling. VLDB 1981: 499-509
  10. Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223
  11. Gary H. Sockut, Robert P. Goldberg: Database Reorganization - Principles and Practice. ACM Comput. Surv. 11(4): 371-395(1979)
  12. William G. Tuel Jr.: Optimum Reorganization Points for Linearly Growing Files. ACM Trans. Database Syst. 3(1): 32-40(1978)
  13. Mario Schkolnick: A Survey of Physical Database Design Methodology and Techniques. VLDB 1978: 474-487
  14. Witold Litwin: Virtual Hashing: A Dynamically Changing Hashing. VLDB 1978: 517-523
  15. Daniel J. Rosenkrantz: Dynamic Database Dumping. SIGMOD Conference 1978: 3-8
  16. Guy M. Lohman, John A. Muckstadt: Optimal Policy for Batch Operations: Backup, Checkpointing, Reorganization, and Updating. ACM Trans. Database Syst. 2(3): 209-222(1977)
  17. T. H. Merrett: Database Cost Analysis: a Top-Down Approach. SIGMOD Conference 1977: 135-143
  18. S. Bing Yao, K. Sundar Das, Toby J. Teorey: A Dynamic Database Reorganization Algorithm. ACM Trans. Database Syst. 1(2): 159-174(1976)
  19. Leon E. Winslow, J. C. Lee: Optimal Choice of Data Restructuring Points. VLDB 1975: 353-363
  20. K. Sundar Das, Toby J. Teorey, S. Bing Yao: Reorganization Points for File Designs with Nonlinear Processing Costs. VLDB 1975: 516-518
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
CACM, ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 23:51:46 2009