论文信息 - Multiattribute hashing using Gray codes - 字舞流文

Multiattribute hashing using Gray codes

Multiattribute hashing and its variations have been proposed for partial match and range queries in the past. The main idea is that each record yields a bitstring

FaloutsosChristos

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

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

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

[4] E. Gilbert. Gray codes and paths on the N-cube , 1958 .

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

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

[7] Alfonso F. Cardenas. Analysis and performance of inverted data base structures , 1975, CACM.

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

[9] Kotagiri Ramamohanarao,et al. Partial-match retrieval using hashing and descriptors , 1983, TODS.

[10] Kotagiri Ramamohanarao,et al. Partial-match retrieval for dynamic files , 1982, BIT.

[11] John W. Lloyd. Optimal partial-match retrieval , 1980, BIT Comput. Sci. Sect..

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

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

[14] T. H. Merrett,et al. A class of data structures for associative searching , 1984, PODS.