Method and apparatus for using a hash-partitioned index to access a table that is not partitioned or partitioned independently of the hash partitioned index
First Claim
1. A method for using an index that is hash-partitioned to access a table that is not hash-partitioned, the method comprising:
- receiving a request at the database system to perform an operation involving a table in the database; and
if performing the operation involves looking up a key in the hash-partitioned index, the method further comprises;
applying a hash function to the key to identify a unique partition within the hash-partitioned index for the key; and
using the key to perform a lookup in the identified partition to identify zero or more rows of the table that match the key.
1 Assignment
0 Petitions
Accused Products
Abstract
One embodiment of the present invention provides a system that uses an index that is hash-partitioned to access a table that is not hash-partitioned. During system operation, the database receives a request to perform an operation involving a table in the database. If performing the operation involves looking up a key in the hash-partitioned index, the database applies a hash function to the key to identify a unique partition within the hash-partitioned index for the key, and uses the key to perform a lookup in the identified partition to identify zero or more rows of the table that match the key.
90 Citations
54 Claims
-
1. A method for using an index that is hash-partitioned to access a table that is not hash-partitioned, the method comprising:
-
receiving a request at the database system to perform an operation involving a table in the database; and
if performing the operation involves looking up a key in the hash-partitioned index, the method further comprises;
applying a hash function to the key to identify a unique partition within the hash-partitioned index for the key; and
using the key to perform a lookup in the identified partition to identify zero or more rows of the table that match the key. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method that uses a hash-partitioned index to access a table that is not hash-partitioned, the method comprising:
-
receiving a request at the database system to perform an operation involving a table in the database; and
if performing the operation involves looking up a key in the hash-partitioned index, the method further comprises;
applying a hash function to the key to identify a unique partition within the hash-partitioned index for the key; and
using the key to perform a lookup in the identified partition to identify zero or more rows of the table that match the key. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36)
-
-
37. An apparatus for using an index that is hash-partitioned to access a table that is not hash-partitioned comprising:
-
a receiving mechanism configured to receive requests to perform an operation involving a table in the database; and
a lookup mechanism, wherein if performing the operation involves looking up a key in the hash-partitioned index, the lookup mechanism is configured to, apply the hash function to the key to identify a unique partition within the hash-partitioned index for the key, and to perform a lookup in the identified partition to identify zero or more rows of the table that match the key. - View Dependent Claims (38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54)
-
Specification