Storage mappings for multidimensional linear dynamic hashing

Many physical database organizations have been proposed in the past few years to deal with the requirements of handling complex queries efficiently, performing maintenance and updates at low cost, and providing high storage utilization While it is known that no database organization can be optimal under all circumstances, a number of recent developments have opened the way towards the design of storage structures which can simultaneously satisfy a number of the requirements listed above

[1]  T. H. Merrett,et al.  Dynamic Multipaging: A Storage Structure for Large Shared Data Banks , 1982, JCDKB.

[2]  Per-Åke Larson,et al.  Linear Hashing with Partial Expansions , 1980, VLDB.

[3]  Witold Litwin,et al.  Linear Hashing: A new Algorithm for Files and Tables Addressing , 1980, ICOD.

[4]  Aris M. Ouksel,et al.  Multidimensional B-trees for associative searching in database systems , 1982, Inf. Syst..

[5]  Aris M. Ouksel,et al.  MultidimensionalB-trees: Analysis of dynamic behavior , 1981, BIT.

[6]  Walter A. Burkhard,et al.  Interpolation-based index maintenance , 1983, BIT.

[7]  James B. Rothnie,et al.  Attribute based file organization in a paged memory environment , 1974, CACM.

[8]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[9]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[10]  J. P. Tremblay,et al.  Key-To-Address Transformation Techniques , 1978 .

[11]  Rangasami L. Kashyap,et al.  Analysis of the Multiple-Attribute-Tree Data-Base Organization , 1977, IEEE Transactions on Software Engineering.

[12]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[13]  Witold Litwin,et al.  Trie hashing , 1981, SIGMOD '81.

[14]  Mohamed Ouksel.  Order-preserving dynamic hashing schemes for associative searching in data base systems , 1983 .