Multi-dimensional clustering for data base organizations

摘要

A new record-clustering scheme is introduced, in which the record address is determined by multiple keys. Associated with this storage scheme is a new type of index called multi-dimensional directory. Those keys which determine the record address are jointly indexed by this directory. A data base structure which combines this new technique and the file inversion technique is analyzed. The costs of retrieval, update and storage space for this data base structure are mathematically formulated. An example illustrates that this new data base structure can be superior to the classical combination of indexed sequential and file inversion techniques.