Method and system for access and display of data from large data sets

• US 7,899,844 B2
• Filed: 04/08/2005
• Issued: 03/01/2011
• Est. Priority Date: 12/18/2001
• Status: Active Grant

• Current Assignee: Siebel Systems Inc. (Oracle Corporation)
• Original Assignee: Siebel Systems Inc. (Oracle Corporation)
• Inventors: Predovic, Daniel Thomas
• Primary Examiner(s): Channavajjala; Srirama
• Assistant Examiner(s): Le; Jessica N
• Application Number:
  US11/101,752
• Publication Number:
  US 20070244849A1
• Time in Patent Office: 2,153 Days
• Field of Search: 707/201, 707/206, 707 2- 3
• US Class Current: 707/802
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99937 Sorting

Abstract

A method and system for accessing and display of data records from large data sets. The method includes defining a plurality of boundaries to logically partition the large data set into a plurality of buckets in accordance with a predefined sort order. The sort order is based on data stored in at least two columns of a database table in which at least a base portion of each data record is stored. In response to a request to retrieve a data record or group of related records, such as all contacts having a given first and last name, a determination is made to which bucket the data record or at least a portion of group of related records are stored in. A query is then formulated to retrieve a subset of the large set of records from the database corresponding to data records contained in the bucket.

Claims

1. A computer-readable storage medium having stored therein a set of instructions which, when executed, perform a method comprising:

defining a first boundary set by iterating through a number of record rows, wherein

the record rows are retrieved from a database and are sorted according to a sort order,

each of the record rows comprises a plurality of columns, the sort order is based on data stored in at least two columns of the plurality of columns,

the first boundary set comprises a plurality of boundary markers,

the defining comprises iterating through the record rows, and defining a boundary marker every Nth row of the record rows, wherein

N is a data bucket size,

a value of N is less than the number of record rows,

the value of N is inversely proportional to a percentage of the number of record rows that is represented by a number of rows requested,

the number of rows requested is determined according to a user-specified selection criterion, and

each boundary marker comprises a set of data corresponding to row data of a corresponding row of the at least two columns on which the sort order is based,

the plurality of boundary markers is configured to logically partition the record rows into a plurality of continuous sections, wherein

each of the plurality of continuous sections comprises N record rows of the record rows, except for a last continuous section of the plurality of continuous sections, and

the last continuous section comprises up to N record rows;

storing the first boundary set, wherein

the boundary markers of the first boundary set are stored in sequential order in accordance with the sort order, and

each pair of sequentially-adjacent boundary markers bounds a single continuous section of the plurality of continuous sections;

receiving a request for requested rows from the record rows sorted in the sort order;

searching the first boundary set for a pair of sequentially-adjacent boundary markers that bounds at least a portion of the requested rows; and

querying the database according to the pair of sequentially-adjacent boundary markers to retrieve a first continuous section that contains at least the portion of the requested rows.

2. The computer-readable storage medium of claim 1, wherein the first boundary set is one of a plurality of boundary sets, wherein each of the plurality of boundary sets defines boundary markers on the record rows according to a different sort order.

3. The computer-readable storage medium of claim 1, wherein the iterating comprises:

sequentially querying the database for at least portions of the record rows in accordance with the sort order.

4. The computer-readable storage medium of claim 1, wherein the value of N is determined according to a user data requirement consideration.

5. The computer-readable storage medium of claim 1, wherein the defining the first boundary set by iterating is performed in an administrative process while the database is operational.

6. The computer-readable storage medium of claim 1, wherein the first boundary set is stored in a table of the database.

7. The computer-readable storage medium of claim 1, wherein the first boundary set is stored as a concatenated list.

8. A method, comprising:

defining, using a computer processor, a first boundary set by iterating through a number of record rows, wherein

the record rows are retrieved from a database according to a sort order,

each of the record rows comprises a plurality of columns,

the sort order is based on data stored in at least two columns of the plurality of columns,

the first boundary set comprises a plurality of boundary markers,

the defining comprises

iterating through the record rows, and

defining a boundary marker every Nth row of the record rows, wherein

N is a data bucket size,

a value of N is less than the number of record rows,

the value of N is inversely proportional to a percentage of the number of record rows that is represented by a number of rows requested,

the number of rows requested is determined according to a user-specified selection criterion, and

each boundary marker comprises a set of data corresponding to row data of a corresponding row of the at least two columns on which the sort order is based,

the plurality of boundary markers is configured to logically partition the record rows into a plurality of continuous sections, wherein

each of the plurality of continuous sections comprises N record rows of the record rows, except for a last continuous section of the plurality of continuous sections, and

the last continuous section comprises up to N record rows;

storing, using the computer processor, the first boundary set, wherein

the boundary markers of the first boundary set are stored in sequential order in accordance with the sort order, and

each pair of sequentially-adjacent boundary markers bounds a single continuous section of the plurality of continuous sections;

receiving a request for requested rows from the record rows sorted in the sort order;

searching the first boundary set for a pair of sequentially-adjacent boundary markers that bounds at least a portion of the requested rows; and

querying the database according to the pair of sequentially-adjacent boundary markers to retrieve a first continuous section that contains at least the portion of the requested rows.

9. The method of claim 8, wherein the iterating comprises:

sequentially querying, using the computer processor, the database for portions of the record rows in accordance with the sort order, wherein

the defining the first boundary set by iterating is performed in an administrative process while the database is operational.

10. A computer system comprising a processor and a memory storing instructions to be executed by the processor, said instructions executable to implement:

means for defining a first boundary set by iterating through a number of record rows, wherein the record rows are retrieved from a database according to a sort order,

each of the record rows comprises a plurality of columns,

the sort order is based on data stored in at least two columns of the plurality of columns,

the first boundary set comprises a plurality of boundary markers,

the means for defining comprises

means for iterating through the record rows, and

means for defining a boundary marker every Nth row of the record rows, wherein

N is a data bucket size,

a value of N is less than the number of record rows,

the value of N is inversely proportional to a percentage of the number of record rows that is represented by a number of rows requested,

the number of rows requested is determined according to a user-specified selection criterion, and

each boundary marker comprises a set of data corresponding to row data of a corresponding row of the at least two columns on which the sort order is based,

the plurality of boundary markers is configured to logically partition the record rows into a plurality of continuous sections, wherein

each of the plurality of continuous sections comprises N record rows of the record rows, except for a last continuous section of the plurality of continuous sections, and

the last continuous section comprises up to N record rows;

means for storing the first boundary set, wherein

the boundary markers of the first boundary set are stored in sequential order in accordance with the sort order, and

each pair of sequentially-adjacent boundary markers bounds a single continuous section of the plurality of continuous sections;

means for receiving a request for requested rows from the record rows sorted in the sort order;

means for searching the first boundary set for a pair of sequentially-adjacent boundary markers that bounds at least a portion of the requested rows; and

means for querying the database according to the pair of sequentially-adjacent boundary markers to retrieve a first continuous section that contains at least the portion of the requested rows.

11. The computer system of claim 10, wherein the means for-iterating comprises:

means for sequentially querying the database for portions of the record rows in accordance with the sort order, wherein

the means for defining the first boundary set by iterating operates in an administrative process while the database is operational.