Multi-Table Search For B-Tree Files
Original Publication Date: 1979-Nov-01
Included in the Prior Art Database: 2005-Feb-20
Methods of organizing large files so that some form of random access is supported have been recognized as important for several years. A particularly successful organization is that of B-trees , serveral variants of which have been developed [2,4,5]. An important advantage of B-tree organizations over hashing methods is that not only is random access supported, but also sequential access.