Computational complexity of an optical disk interface

extended abstract
  • Jeffrey Scott Vitter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


The notion of an I/O interface for optical digital (write-once) disks is introduced that is quite different from earlier research in this area. The purpose of an I/O interface is to allow existing operating systems and application programs that use magnetic disks to use optical disks instead, with minimum difficulty. The interface is especially geared to applications that are not update-intensive or that require access to previous versions of records. We define what it means for an I/O interface to be disk-efficient. We demonstrate a disk-efficient interface and show that its I/O performance in many cases is optimum, up to a constant factor, among all disk-efficient interfaces. The basis of the interface is a data structure we call offset trees, which stores information about intervals with dynamically changing coordinates. Since this complexity model is based on practical concerns, these theoretical results translate nicely into an efficient implementation.


Optical Disk Internal Memory Block Buffer Magnetic Disk Target Address 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. M. Adel'son-Vel'skii and E. M. Landis. An Algorithm for the Organization of Information. An English translation appears in Soviet Mathematics, 3, 5 (July 1962), 1259–1263.Google Scholar
  2. 2.
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).Google Scholar
  3. 3.
    R. F. Arnold, G. R. Hogsett, R. W. Holliday, and P. J. Friedl. STAR, A Data Base System Architecture—Concepts and Facilities. Technical Report ZZ20-6452, IBM Palo Alto Scientific Center (February 1981).Google Scholar
  4. 4.
    G. Copeland. What if Mass Storage Were Free? Computer, 15, 7 (July 1982), 27–35.Google Scholar
  5. 5.
    M. J. Fischer and R. E. Ladner. Data Structures for Efficient Implementation of Sticky Pointers in Text Editors, Technical Report 79-06-08, University of Washington (June 1979).Google Scholar
  6. 6.
    C. M. Goldstein. Optical Disk Technology and Information. Science, 215, 4534 (Feb. 1982), 862–868.Google Scholar
  7. 7.
    L. J. Guibas and R. Sedgewick. A Dichromatic Framework for Balanced Trees. Proc. 19th Annual IEEE Symposium on Foundations of Computer Science, Ann Arbor, MI (October 1978), 8–20.Google Scholar
  8. 8.
    D. Maier. Using Write-Once Memory for Database Storage. Proc. 1st Annual ACM Symposium on Principles of Database Systems, Los Angeles, CA (March 1982), 239–246.Google Scholar
  9. 9.
    B. T. O'Lear and J. H. Choy. Software Considerations in Mass Storage Systems. Computer, 15, 7 (July 1982), 36–44.Google Scholar
  10. 10.
    P. Rathmann. Dynamic Data Structures on Optical Disks. Proc. IEEE Computer Data Engineering Conference, Los Angeles, CA (April 1984).Google Scholar
  11. 11.
    R. L. Rivest and A. Shamir. How to Reuse a “Write-Once” Memory. Proc. 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA (May 1982), 105–113.Google Scholar
  12. 12.
    D. D. Sleator and R. E. Tarjan. Self-Adjusting Binary Search Trees. A summary appears in Proc. 15th Annual ACM Symposium on Theory of Computing, Boston, MA (April 1983), 235–245.Google Scholar
  13. 13.
    J. S. Vitter. Search Mechanisms for Optical Disks. Internal Memo, IBM Palo Alto Scientific Center (March 1983).Google Scholar
  14. 14.
    J. S. Vitter. US&R: A New Framework for Redoing. Proc. ACM Symposium on Practical Software Development Environments, Pittsburgh, PA (April 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Jeffrey Scott Vitter
    • 1
  1. 1.Department of Computer ScienceBrown UniversityProvidenceUSA

Personalised recommendations