This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries
May 1982 (vol. 8 no. 3)
pp. 235-249
C.C. Chang, Institute of Computer Engineering, National Chiao-Tung University
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.
Index Terms:
symbolic Gray code, Bucket-oriented symbolic Gray code, Cartesian product file, multiattribute file organization, partial match query, perfect hashing
Citation:
C.C. Chang, R.C.T. Lee, M.W. Du, "Symbolic Gray Code as a Perfect Multiattribute Hashing Scheme for Partial Match Queries," IEEE Transactions on Software Engineering, vol. 8, no. 3, pp. 235-249, May 1982, doi:10.1109/TSE.1982.235253
Usage of this product signifies your acceptance of the Terms of Use.