论文信息 - Implicit Data Structures for Linear Hashing Schemes - 字舞流文

Implicit Data Structures for Linear Hashing Schemes

Aris M. Ouksel | Peter Scheuermann | A. Ouksel | P. Scheuermann

[1] Witold Litwin,et al. The bounded disorder access method , 1986, 1986 IEEE Second International Conference on Data Engineering.

[2] Patrick Valduriez,et al. A multikey hashing scheme using predicate trees , 1984, SIGMOD '84.

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

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

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

[6] David B. Lomet,et al. Bounded index exponential hashing , 1983, TODS.

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

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

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

[10] G. N.N. Martin,et al. Spiral Storage: Incrementally Augmentable Hash Addressed Storage , 1979 .

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