# US 2006/0080270 A1 · Method for determining an access mode to a dataset

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2006/0080270 A1
- Document ID: US20060080270A1
- Status: Published application
- Kind: A1
- Application number: 10/960,531
- Filed: 2004-10-07
- Published: 2006-04-13
- Earliest claimed: 2004-10-07
- Assignees: International Business Machines Corporation
- Inventors: Shigeko Mori
- Web page: https://patentgrep.com/patent/US20060080270A1

## CPC

- G06F 16/2282: {Tablespace storage structures; Management thereof}
- Y10S 707/99932: Access augmentation or optimizing
- Y10S 707/99942: Manipulating data structure, e.g. compression, compaction, compilation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A method and system are provided for identifying and selecting an optimal access method for reading an ILDS. A counter is associated with a pointer and identifies the number of times a database partition has been reorganized. Based upon a comparison of the counter from the pointer with a second counter from a second pointer, the optimal access method is determined. Since the comparison of pointers is conducted without reading the ILDS, the optimal access method is determined prior to reading the ILDS, which improves pointer checking performance. A direct access method may be selected if the access rate is lower than a predetermining threshold value, a sequential access method may be selected if the access rate is higher than a predetermined threshold value, and a skip sequential access method may be selected if the access rate is within a predetermined value.

## Claims

### Claim 1

A method for accessing a dataset comprising:
maintaining a first counter in a first database, wherein the first counter identifies a number of times the first database has been reorganized;
maintaining a set of counters in a set of databases pointing to the first database, wherein each of the counters in said set of counters identifies a number of times an associated database has been reorganized;
determining a maximum value among said first counter and the set of counters;
calculating an access rate to the dataset based on a total number of data records in the dataset and a quantity of counters having a counter value less than said maximum value; and
selecting an access method to the dataset based upon said calculated access rate.

### Claim 2 (depends on 1)

The method of claim 1, further comprising selecting a direct access method if the access rate is lower than a predetermining threshold value.

### Claim 3 (depends on 1)

The method of claim 1, further comprising selecting a sequential access method if the access rate is higher than a predetermined threshold value.

### Claim 4 (depends on 1)

The method of claim 1, further comprising selecting a skip sequential access method if the access rate is within a predetermined value.

### Claim 5

A method for accessing at least one dataset comprising:
maintaining a counter in each partition of a first database, wherein the counter identifies a number of times each partition has been reorganized;
maintaining a set of counters in a set of databases pointing to the first database, wherein each counter in said set of counters is maintained for each associated partition in one of the databases and identifies a number of times the associated partition has been reorganized;
determining for each partition, a maximum value among said first counter and the set of counters;
calculating for said partition an access rate to a dataset corresponding to each partition, wherein said access rate is based on a total number of data records in the dataset and the number of counters having counter values less than said maximum value; and
selecting an access method for each partition to the dataset based upon said calculated access rate.

### Claim 6 (depends on 5)

The method of claim 5, wherein the step of selecting an access method includes selecting a direct access method if the access rate is lower than a predetermining threshold value.

### Claim 7 (depends on 5)

The method of claim 5, wherein said access method is a sequential access method if the access rate is higher than a predetermined threshold value.

### Claim 8 (depends on 5)

The method of claim 5, wherein said access method is a skip sequential access method if the access rate is within a predetermined value.

### Claim 9

An article comprising:
a computer-readable signal bearing medium;
means in the medium for maintaining a first counter in a first database, wherein the first counter identifies a number of times the first database has been reorganized;
means in the medium for maintaining a set of counters in a set of databases pointing to the first database, wherein each of the counters in said set of counters identifiers a number of times an associated database has been reorganized;
means in the medium for determining a maximum value among said first counter and said set of counters;
means in the medium for calculating an access rate to a dataset based on a total number of data records in the dataset and a quantity of counters having a counter value less than said maximum value; and
means in the medium for selecting an access method to a dataset based upon said calculated access rate.

### Claim 10 (depends on 9)

The article of claim 9, wherein said medium is selected from a group consisting of: a recordable data storage medium, and a modulated carrier signal.

### Claim 11 (depends on 9)

The article of claim 9, further comprising means in the medium for selecting a direct access method if the access rate is lower than a predetermining threshold value.

### Claim 12 (depends on 9)

The article of claim 9, further comprising means in the medium for selecting a sequential access method if the access rate is higher than a predetermined threshold value.

### Claim 13 (depends on 9)

The article of claim 9, further comprising means in the medium for selecting a skip sequential access method if the access rate is within a predetermined value.

### Claim 14

An article comprising:
a computer readable signal bearing medium;
means in the medium for maintaining a counter in each partition of a first database, wherein the counter identifies a number of times each partition has been reorganized;
means in the medium for maintaining a set of counters in a set of databases pointing to the first database, wherein each counter in said set of counters is maintained for each associated partition in one of the databases and identifies a number of times the associated partition has been reorganized;
means in the medium determining for each partition a maximum value among said first counter and said set of counters; means in the medium for calculating for each partition an access rate to a dataset corresponding to each partition, wherein the access rate is based on a total number of data records in the dataset and the number of counters having counter values less than said maximum value; and means in the medium for selecting an access method for each partition to the dataset based upon said calculated access rate.

### Claim 15 (depends on 14)

The article of claim 14, wherein said medium is selected from a group consisting of: a recordable data storage medium, and a modulated carrier signal.

### Claim 16 (depends on 14)

The article of claim 14, further comprising means in the medium for selecting a direct access method if the access rate is lower than a predetermining threshold value.

### Claim 17 (depends on 14)

The article of claim 14, further comprising means in the medium for selecting a sequential access method if the access rate is higher than a predetermined threshold value.

### Claim 18 (depends on 14)

The article of claim 14, further comprising means in the medium for selecting a skip sequential access method if the access rate is within a predetermined value.
