The Multilevel Grid File - A Dynamic Hierarchical Multidimensional File Structure

We present a new dynamic hashed file organization that solves most problems associated with the directory of the grid file proposed by Nievergelt et al. Our scheme is a multilevel extension of the grid file that supports multiattribute accesses to the file for exact-match, partialmatch, and range queries as well as graceful expansion and shrinkage of the file in a dynamic environment. This new file organization offers a number of advantages over the grid file such as compact representation of the directory, linear growth of the directory in the number of records, easy splitting and merging of the directory, efficient processing of partial-match queries, and finer granularity of the directory. Moreover, it provides a new concept, calledabshuct d , that can be employed in practical database applications.

[1]  Per-Åke Larson,et al.  Dynamic hashing , 1978, BIT.

[2]  Ravi Krishnamurthy,et al.  Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract) , 1984, VLDB.

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

[4]  Alfred V. Aho,et al.  Optimal partial-match retrieval when fields are independently specified , 1979, ACM Trans. Database Syst..

[5]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[6]  Walter A. Burkhard.  Partial match retrieval , 1976 .

[7]  Ekow J. Otoo,et al.  Balanced multidimensional extendible hash tree , 1985, PODS.

[8]  Kyu-Young Whang.  Property of separability in physical design of network model databases , 1985, Inf. Syst..

[9]  Kyu-Young Whang.  Index Selection in Relational Databases , 1985, FODO.

[10]  James K. Mullin.  Tightly controlled linear hashing without separate overflow storage , 1981, BIT Comput. Sci. Sect..

[11]  Klaus Hinrichs,et al.  The grid file system , 1985 .

[12]  Jack A. Orenstein.  Multidimensional Tries Used for Associative Searching , 1982, Inf. Process. Lett..

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

[14]  Witold Litwin,et al.  Virtual Hashing: A Dynamically Changing Hashing , 1978, VLDB.

[15]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[16]  Michel Scholl,et al.  New file organization based on dynamic hashing , 1981, TODS.

[17]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[18]  David B. Lomet,et al.  Digital B-Trees , 1981, VLDB.

[19]  S. Bing Yao,et al.  Multi-dimensional clustering for data base organizations , 1977, Inf. Syst..

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

[21]  Ekow J. Otoo,et al.  A Mapping Function for the Directory of a Multidimensional Extendible Hashing , 1984, VLDB.

[22]  Klaus H. Hinrichs.  The grid file system: implementation and case studies of applications , 1985 .

[23]  Per-Åke Larson,et al.  Performance analysis of linear hashing with partial expansions , 1982, TODS.

[24]  Gio Wiederhold,et al.  Database Design , 1977 .

[25]  Aris M. Ouksel,et al.  Storage mappings for multidimensional linear dynamic hashing , 1983, PODS.

[26]  Gio Wiederhold,et al.  Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.

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

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

[29]  Walter A. Burkhard,et al.  Hashing and trie algorithms for partial match retrieval , 1976, TODS.

[30]  Arvola Chan,et al.  Index selection in a self-adaptive data base management system , 1976, SIGMOD '76.

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

[32]  李幼升,et al.  Ph , 1989 .

[33]  Rudolf Bayer,et al.  Prefix B-trees , 1977, TODS.

[34]  Masaya Nakayama,et al.  Algorithm and performance evaluation of adaptive multidimensional clustering technique , 1985, SIGMOD '85.

[35]  Henk M. Blanken,et al.  Index selection in relational databases , 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

[36]  Ekow J. Otoo.  A multidimensional digital hashing scheme for files with composite keys , 1985, SIGMOD '85.

[37]  Gio Wiederhold,et al.  Separability —An Approach to Physical Database Design , 1984, IEEE Transactions on Computers.

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

[39]  Philip A. Bernstein,et al.  Using Semi-Joins to Solve Relational Queries , 1981, JACM.

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

[41]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[42]  Ronald L. Rivest,et al.  Partial-Match Retrieval Algorithms , 1976, SIAM J. Comput..

[43]  Azad Bolour.  Optimality Properties of Multiple-Key Hashing Functions , 1979, JACM.