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

Authors:
C. C. Chang;R. C. T. Lee;M. W. Du
Affiliations:
Institute of Computer Engineering, National Chiao-Tung University;-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1982

Citing 0
Cited 2

A cache invalidation scheme for continuous partial match queries in mobile computing environments

Distributed and Parallel Databases
Schemes for Digital Gift Certificates with Low Computation Complexity

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.