# US 2021/0279224 A1 · Combinators

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

- Number: US 2021/0279224 A1
- Document ID: US20210279224A1
- Status: Published application
- Kind: A1
- Application number: 17/318,725
- Filed: 2021-05-12
- Published: 2021-09-09
- Earliest claimed: 2009-06-19
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Rich Skrenta; Bryn Robert Dole; Michael Markson; Keith Peters; Robert Michael Saliba; Robert N. Truel; Gregory B. Lindahl
- Web page: https://patentgrep.com/patent/US20210279224A1

## CPC

- G06F 16/2282: {Tablespace storage structures; Management thereof}
- G06F 16/2228: {Indexing structures}
- G06F 16/24554: {Unary operations; Data partitioning operations}
- G06F 16/2462: {Approximate or statistical queries}
- G06F 16/273: {Asynchronous replication or reconciliation}
- G06F 16/285: {Clustering or classification}
- G06F 16/951: Indexing; Web crawling techniques
- G06F 16/953: Querying, e.g. by the use of web search engines
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method, according to one embodiment, includes identifying data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node; assigning an identifier and a data storage hierarchical level to the data; mapping the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node; receiving a plurality of write operations; and combining a plurality of write tasks of the predetermined portion for a predetermined time period.

## Claims

### Claim 1

A computer-implemented method, comprising:
identifying data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node;
assigning an identifier and a data storage hierarchical level to the data;
mapping the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node;
receiving a plurality of write operations; and
combining a plurality of write tasks of the predetermined portion for a predetermined time period.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, comprising delaying one or more of the plurality of write operations to collect additional write operations designated to the predetermined portion.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the predetermined time period includes a time period needed to collect a total amount of write operations that meet a predetermined file size.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, comprising:
designating a merging limit value to the one or more tables on the predetermined portion, wherein the merging limit value is indicative of one of a plurality of data storage hierarchical levels; and
limiting a merging of files in accordance with the merging limit value by refraining from merging data files in the one of the plurality of data storage hierarchical levels once the merging limit value is met.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, comprising:
storing a bloom filter for a plurality of row keys for each of a plurality of data storage hierarchical levels; and
consulting the bloom filter to determine whether one of the plurality of row keys is found in a given data storage hierarchical level of the plurality of data storage hierarchical levels.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, comprising metering the combined plurality of write tasks.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the data storage hierarchical level includes a first hierarchical level indicative of oldest data in the one or more tables on the predetermined portion.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein the data storage hierarchical level includes a second hierarchical level indicative of newer stored data in the one or more tables on the predetermined portion.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein the data storage hierarchical level includes a third hierarchical level indicative of most recently stored data in the one or more tables on the predetermined portion.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, wherein the plurality of write tasks are written to the third hierarchical level, data stored in the third hierarchical level is merged to the second hierarchical level after a first predetermined time period, and the data stored in the second hierarchical level is merged to the first hierarchical level after a second predetermined time period.

### Claim 11

A computer program product for organizing data in a database system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying, utilizing the processor, data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node;
assigning, utilizing the processor, an identifier and a data storage hierarchical level to the data;
mapping, utilizing the processor, the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node;
receiving, utilizing the processor, a plurality of write operations; and
combining, utilizing the processor, a plurality of write tasks of the predetermined portion for a predetermined time period.

### Claim 12 (depends on 11)

The computer program product of claim 11, comprising delaying one or more of the plurality of write operations to collect additional write operations designated to the predetermined portion.

### Claim 13 (depends on 11)

The computer program product of claim 11, wherein the predetermined time period includes a time period needed to collect a total amount of write operations that meet a predetermined file size.

### Claim 14 (depends on 11)

The computer program product of claim 11, comprising:
designating a merging limit value to the one or more tables on the predetermined portion, wherein the merging limit value is indicative of one of a plurality of data storage hierarchical levels; and
limiting a merging of files in accordance with the merging limit value by refraining from merging data files in the one of the plurality of data storage hierarchical levels once the merging limit value is met.

### Claim 15 (depends on 11)

The computer program product of claim 11, comprising:
storing a bloom filter for a plurality of row keys for each of a plurality of data storage hierarchical levels; and
consulting the bloom filter to determine whether one of the plurality of row keys is found in a given data storage hierarchical level of the plurality of data storage hierarchical levels.

### Claim 16 (depends on 11)

The computer program product of claim 11, comprising metering the combined plurality of write tasks.

### Claim 17 (depends on 11)

The computer program product of claim 11, wherein the data storage hierarchical level includes a first hierarchical level indicative of oldest data in the one or more tables on the predetermined portion.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the data storage hierarchical level includes a second hierarchical level indicative of newer stored data in the one or more tables on the predetermined portion.

### Claim 19 (depends on 18)

The computer program product of claim 18, wherein the data storage hierarchical level includes a third hierarchical level indicative of most recently stored data in the one or more tables on the predetermined portion.

### Claim 20

A system, comprising:
a processor; and
logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to:
identify data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node;
assign an identifier and a data storage hierarchical level to the data;
map the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node;
receive a plurality of write operations; and
combine a plurality of write tasks of the predetermined portion for a predetermined time period.
