Reorganization Points for File Designs with Nonlinear Processing Costs.

@inproceedings{DBLP:conf/vldb/DasTY75,
  author    = {K. Sundar Das and
               Toby J. Teorey and
               S. Bing Yao},
  editor    = {Douglas S. Kerr},
  title     = {Reorganization Points for File Designs with Nonlinear Processing
               Costs},
  booktitle = {Proceedings of the International Conference on Very Large Data
               Bases, September 22-24, 1975, Framingham, Massachusetts, USA},
  publisher = {ACM},
  year      = {1975},
  pages     = {516-518},
  ee        = {db/conf/vldb/DasTY75.html},
  crossref  = {DBLP:conf/vldb/75},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/vldb7588 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Printed Edition

References

[1]

...

[2]

Ben Shneiderman: Optimum Data Base Reorganization Points. Commun. ACM 16(6): 362-365(1973) BibTeX

[3]

...

Referenced by

1. Lars Söderlund: Concurrent Data Base Reorganization - Assessment of a Powerful Technique through Modeling. VLDB 1981: 499-509
2. William G. Tuel Jr.: Optimum Reorganization Points for Linearly Growing Files. ACM Trans. Database Syst. 3(1): 32-40(1978)