Self-adjusting binary search trees
Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Using write-once memory for database storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Dynamic Data Structures on Optical Disks
Proceedings of the First International Conference on Data Engineering
Computational Complexity of an Optical Disk Interface (Extended Abstract)
Proceedings of the 11th Colloquium on Automata, Languages and Programming
How to reuse a "write - once " memory (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A distributed repository for immutable persistent objects
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
Log files: an extended file service exploiting write-once storage
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Efficient placement of audio data on optical disks for real-time applications
Communications of the ACM
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Optimal placement of high-probability randomly retrieved blocks on CLV optical discs
ACM Transactions on Information Systems (TOIS)
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Dynamic maintenance of web indexes using landmarks
WWW '03 Proceedings of the 12th international conference on World Wide Web
| Hi-index | 0.02 |
We introduce the notion of an I/O interface for optical digital (write-once) disks, which is quite different from earlier research. 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 minimal change. We define what it means for an I/O interface to be disk-efficient. We demonstrate a practical disk- efficient I/O interface and show that its I/O performance in many cases is optimum, up to a constant factor, among all disk-efficient interfaces. The interface is most effective for applications that are not update-intensive. An additional capability is a built-in history mechanism that provides software support for accessing previous versions of records. Even if not implemented, the I/O interface can be used as a programming tool to develop efficient special purpose applications for use with optical disks.