Disk management for object-oriented databases

An object-oriented database provides persistent storage for a large number of objects. These objects may be very small, and the access patterns are likely to be not as uniform as the mostly sequential reads and writes seen in file-systems. For example, the 007 benchmark for object-oriented databases specifies a number of traversals that follow pointers around a graph of objects. Given these differences between file-systems and object-oriented databases, disk management techniques used in file-systems will not perform well if naively applied to object-oriented databases. This paper proposes three disk management strategies for object-oriented databases. These strategies are based on earlier work on file-systems. They differ from this earlier work in their support for a large number of small objects and non-sequential access patterns.<<ETX>>