# US 2018/0322187 A1 · Dynamic alternate keys for use in file systems utilizing a keyed index

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

- Number: US 2018/0322187 A1
- Document ID: US20180322187A1
- Status: Published application
- Kind: A1
- Application number: 16/038,045
- Filed: 2018-07-17
- Published: 2018-11-08
- Earliest claimed: 2014-08-13
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Terri A. Menendez
- Web page: https://patentgrep.com/patent/US20180322187A1

## CPC

- G06F 16/328: {Management therefor}
- G06F 16/901: Indexing; Data structures therefor; Storage structures (for retrieval from the web G06F16/951)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In one embodiment, a method for providing alternate keys in a keyed index includes creating a first base record in a keyed index of a database, the first base record including a first unique key and a first data record, wherein the first data record includes at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair, and creating one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record. The database adheres to virtual storage access method (VSAM) in some approaches. In other approaches, a number of alternate key records created is equal to a number of first sub keys in the first data record.

## Claims

### Claim 1

A computer program product for providing alternate keys in a keyed index, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code being readable and/or executable by at least one processor to cause the at least one processor to:
create, by the at least one processor, a first base record in a database, the first base record including a first unique key and a first data record, wherein the first data record comprises at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair; and
create, by the at least one processor, one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record,
wherein a number of alternate key records created is equal to a number of first sub keys in the first data record.

### Claim 2 (depends on 1)

The computer program product as recited in claim 1, wherein the program code is further readable and/or executable by the at least one processor to:
create a second base record in the database, the second base record including a second unique key and a second data record, wherein the second data record comprises at least one sub key and at least one second value, each sub key being correlated with a different one of the at least one second value in a sub key/value pair; and
create one or more additional alternate key records in the database when one or more sub keys are unique to the second base record, each of the additional alternate key records including an unique sub key from the second base record correlated with the second unique key of the second base record.

### Claim 3 (depends on 2)

The computer program product as recited in claim 2, wherein the program code is further readable and/or executable by the at least one processor to update an existing alternate key record to store the second unique key and the first unique key when the first base record and the second base record are both correlated with a specific sub key of the existing alternate key record.

### Claim 4 (depends on 3)

The computer program product as recited in claim 3, wherein the program code is further readable and/or executable by the at least one processor to update the existing alternate key record to remove the second unique key when the specific sub key of the existing alternate key record is removed from the second base record.

### Claim 5 (depends on 2)

The computer program product as recited in claim 2, wherein the program code is further readable and/or executable by the at least one processor to delete an existing alternate key record when a specific sub key of the existing alternate key record is removed from all base records.

### Claim 6 (depends on 1)

The computer program product as recited in claim 1, wherein the database adheres to virtual storage access method (VSAM), wherein a plurality of base records are created in the keyed index, and wherein the keyed index is a key sequence data set (KSDS).

### Claim 7

A computer program product for providing alternate keys in a keyed index, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code being readable and/or executable by at least one processor to cause the at least one processor to:
create, by the at least one processor, a first base record in a database, the first base record including a first unique key and a first data record, wherein the first data record comprises at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair; and
create, by the at least one processor, one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record,
wherein a number of alternate key records created is equal to a number of first sub keys in the first data record,
wherein the database adheres to virtual storage access method (VSAM).

### Claim 8 (depends on 7)

The computer program product as recited in claim 7, wherein the program code is further readable and/or executable by the at least one processor to:
create a second base record in the database, the second base record including a second unique key and a second data record, wherein the second data record comprises at least one sub key and at least one second value, each sub key being correlated with a different one of the at least one second value in a sub key/value pair; and
create one or more additional alternate key records in the database when one or more sub keys are unique to the second base record, each of the additional alternate key records including an unique sub key from the second base record correlated with the second unique key of the second base record.

### Claim 9 (depends on 8)

The computer program product as recited in claim 8, wherein the program code is further readable and/or executable by the at least one processor to update an existing alternate key record to store the second unique key and the first unique key when the first base record and the second base record are both correlated with a specific sub key of the existing alternate key record.

### Claim 10 (depends on 9)

The computer program product as recited in claim 9, wherein the program code is further readable and/or executable by the at least one processor to update the existing alternate key record to remove the second unique key when the specific sub key of the existing alternate key record is removed from the second base record.

### Claim 11 (depends on 8)

The computer program product as recited in claim 8, wherein the program code is further readable and/or executable by the at least one processor to delete an existing alternate key record when a specific sub key of the existing alternate key record is removed from all base records.

### Claim 12 (depends on 7)

The computer program product as recited in claim 7, wherein a plurality of base records are created in the keyed index, and wherein the keyed index is a key sequence data set (KSDS).

### Claim 13

A method for providing alternate keys in a keyed index, the method comprising:
creating a first base record in a keyed index of a database, the first base record including a first unique key and a first data record, wherein the first data record comprises at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair; and
creating one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record,
wherein the database adheres to virtual storage access method (VSAM),
wherein a plurality of base records are created in the keyed index, and
wherein the keyed index is a key sequence data set (KSDS).

### Claim 14 (depends on 13)

The method as recited in claim 13, further comprising:
creating a second base record in the database, the second base record including a second unique key and a second data record, wherein the second data record comprises at least one sub key and at least one second value, each sub key being correlated with a different one of the at least one second value in a sub key/value pair; and
creating one or more additional alternate key records in the database when one or more sub keys are unique to the second base record, each of the additional alternate key records including an unique sub key from the second base record correlated with the second unique key of the second base record.

### Claim 15 (depends on 14)

The method as recited in claim 14, further comprising updating an existing alternate key record to store the second unique key and the first unique key when the first base record and the second base record are both correlated with a specific sub key of the existing alternate key record.

### Claim 16 (depends on 15)

The method as recited in claim 15, further comprising updating the existing alternate key record to remove the second unique key when the specific sub key of the existing alternate key record is removed from the second base record.

### Claim 17 (depends on 14)

The method as recited in claim 14, further comprising deleting an existing alternate key record when a specific sub key of the existing alternate key record is removed from all base records.

### Claim 18 (depends on 13)

The method as recited in claim 13, wherein a number of alternate key records created is equal to a number of first sub keys in the first data record.

### Claim 19 (depends on 13)

The method as recited in claim 13, wherein each of the plurality of base records includes a unique key specific to each base record of the plurality of base records.
