Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries

In this paper, we shall show that the symbolic Gray code hashing mechanism is not only good for best matching, but also good for partial match queries. Essentially, we shall propose a new hashing scheme, called bucket-oriented symbolic Gray code, which can be used to produce any arbitrary Cartesian product file, which has been shown to be good for partial match queries. Many interesting properties of this new multiattribute hashing scheme, including the property that it is a perfect hashing scheme, have been discussed and proved.

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

[2]  Walter A. Burkhard,et al.  Some approaches to best-match file searching , 1973, Commun. ACM.

[3]  M. W. Du,et al.  The Study of a New Perfect Hash Scheme , 1983, IEEE Transactions on Software Engineering.

[4]  Chin-Chen Chang,et al.  Some properties of Cartesian product files , 1980, SIGMOD '80.

[5]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[6]  Richard J. Cichelli.  Minimal perfect hash functions made simple , 1980, CACM.

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

[8]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

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

[10]  Renzo Sprugnoli,et al.  Perfect hashing functions , 1977, Commun. ACM.

[11]  C. W. Shen,et al.  A nearest neighbor search technique with short zero-in time , 1978, COMPSAC.

[12]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[13]  Richard C. T. Lee,et al.  Symbolic Gray Code as a Multikey Hashing Function , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Richard C. T. Lee,et al.  Application of Principal Component Analysis to Multikey Searching , 1976, IEEE Transactions on Software Engineering.

[15]  Ronald L. Rivest,et al.  Analysis of associative retrieval algorithms , 1974 .

[16]  Richard C. T. Lee,et al.  Common Properties of Some Multiattribute File Systems , 1979, IEEE Transactions on Software Engineering.

[17]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[18]  Sakti P. Ghosh.  Data base organization for data management , 1977 .

[19]  Walter A. Burkhard.  Partial-match hash coding: benefits of redundancy , 1979, TODS.

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

[21]  John S. Sobolewski,et al.  Disk allocation for Cartesian product files on multiple-disk systems , 1982, TODS.

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