APPLYING VARIOUS HASH METHODS USED IN CONJUNCTION WITH A QUERY WITH A GROUP BY CLAUSE
First Claim
Patent Images
1. A computer-based method to apply a plurality of hash methods in a query with a Group By clause comprising:
- identifying a plurality of cells, each of said cells representing a combination of disparate attribute partitions, said disparate attribute partitions formed based on partitioning a set of attribute values of each attribute among a plurality of attributes of a database, and said disparate partitions belonging to different attributes of said database;
identifying a plurality of drawers, each of said drawers comprising a collection of cells from a single partition of a Group By column, and each of said drawers being defined for a specific query;
independently computing a separate hash table for each of said drawers; and
independently applying a hashing scheme picked from among a plurality of hashing schemes for each of said drawers.
1 Assignment
0 Petitions
Accused Products
Abstract
A novel method is described for applying various hash methods used in conjunction with a query with a Group By clause. A plurality of drawers are identified, wherein each of the drawers is made up of a collection of cells from a single partition of a Group By column and each of the drawers being defined for a specific query. A separate hash table is independently computed for each of the drawers and a hashing scheme (picked from among a plurality of hashing schemes) is independently applied for each of the drawers.
-
Citations
23 Claims
-
1. A computer-based method to apply a plurality of hash methods in a query with a Group By clause comprising:
-
identifying a plurality of cells, each of said cells representing a combination of disparate attribute partitions, said disparate attribute partitions formed based on partitioning a set of attribute values of each attribute among a plurality of attributes of a database, and said disparate partitions belonging to different attributes of said database; identifying a plurality of drawers, each of said drawers comprising a collection of cells from a single partition of a Group By column, and each of said drawers being defined for a specific query; independently computing a separate hash table for each of said drawers; and independently applying a hashing scheme picked from among a plurality of hashing schemes for each of said drawers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. An article of manufacture comprising a computer usable medium having computer readable program code embodied therein which implements a computer-based method for applying a plurality of hash methods in a query with a Group By clause, said computer usable medium comprising:
-
computer readable program code identifying a plurality of cells, each of said cells representing a combination of disparate attribute partitions, said disparate attribute partitions formed based on partitioning a set of attribute values of each attribute among a plurality of attributes of a database, and said disparate partitions belonging to different attributes of said database; computer readable program code identifying a plurality of drawers, each of said drawers comprising a collection of cells from a single partition of a Group By column, and each of said drawers being defined for a specific query; computer readable program code independently computing a separate hash table for each of said drawers; and computer readable program code independently applying a hashing scheme picked from among a plurality of hashing schemes for each of said drawers. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer-based method to apply a plurality of hash methods in a query with a Group By clause comprising:
-
identifying a plurality of cells, each of said cells representing a combination of disparate attribute partitions, said disparate attribute partitions formed based on partitioning a set of attribute values of each attribute among a plurality of attributes of a database, and said disparate partitions belonging to different attributes of said database; identifying a plurality of drawers, each of said drawers comprising a collection of cells from a single partition of a Group By column, and each of said drawers being defined for a specific query; independently computing a separate hash table for each of said drawers; and independently applying any of the following hashing schemes; for single column Group Bys, using a hashing scheme that uses group codes as an index to said given drawer'"'"'s hash table; for correlated Group Bys, using a pre-computed minimal perfect hash function, said pre-computed minimal perfect hash function having as many buckets as number of groups in said given drawer; and otherwise, using a linear probing hashing scheme using multiplicative hashing as a hashing function. - View Dependent Claims (18, 19, 20, 21, 22, 23)
-
Specification