Table organization using one or more queries
First Claim
Patent Images
1. A computer-implemented method for reorganizing a database table residing on a computer system according to a set of queries, comprising:
- constructing a bitmap entry for each row entry within the database table, each bitmap entry having n bit positions, each of the n bit positions corresponding to a referencing state of a different one of the set of queries;
computing a single numerical value for each bitmap entry as a function of individual bit values for the n bit positions; and
sorting the row entries within the database table based upon the numerical values of the bitmap entries.
3 Assignments
0 Petitions
Accused Products
Abstract
A method, system and computer program product are provided for reorganizing a database table according to a set of queries. More specifically, the table is reorganized such that random I/O is reduced by more tightly grouping together rows in the table associated with each of the referencing queries. This enables more associated rows from a given table relevant to a query to be read into memory for a given I/O operation.
33 Citations
11 Claims
-
1. A computer-implemented method for reorganizing a database table residing on a computer system according to a set of queries, comprising:
-
constructing a bitmap entry for each row entry within the database table, each bitmap entry having n bit positions, each of the n bit positions corresponding to a referencing state of a different one of the set of queries; computing a single numerical value for each bitmap entry as a function of individual bit values for the n bit positions; and sorting the row entries within the database table based upon the numerical values of the bitmap entries. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification