Partitioned Hash Functions
•A hash function produces k bits identifying the bucket.
•The bits are partitioned among the different attributes.
•Example:
–Age produces the first 3 bits of the bucket number.
–Salary produces the last 3 bits.
•Supports partial matches, but is useless for range queries.