An efficient database storage structure for large dynamic objects

摘要

The author presents storage structures and algorithms for thenefficient manipulation of general-purpose large unstructured objects inna database system. The large object is stored in a sequence ofnvariable-size segments, each of which consists of a large number ofnphysically contiguous disk blocks. A tree structure indexes bytenpositions within the object. Disk space management is based on thenbinary buddy system. The scheme supports operations that replace,ninsert, delete bytes at arbitrary positions within the object, andnappend bytes at the end of the object