# US 2012/0254252 A1 · Input/output efficiency for online analysis processing in a relational database

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

- Number: US 2012/0254252 A1
- Document ID: US20120254252A1
- Status: Published application
- Kind: A1
- Application number: 13/430,897
- Filed: 2012-03-27
- Published: 2012-10-04
- Earliest claimed: 2011-03-31
- Assignees: International Business Machines Corporation
- Inventors: Yi Jin; Lei Li; Li Li Wang; Wan Chuan Zhang
- Web page: https://patentgrep.com/patent/US20120254252A1

## CPC

- G06F 16/283: {Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP}
- G06F 16/221: {Column-oriented storage; Management thereof}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments of the invention relate to improved input/output efficiency for online analysis processing in a relational database. An aspect of the invention includes selecting a table from a relational database. The table is split by column into sub-tables, with at least one of the sub-tables including at least two columns. Each sub-table is written into a corresponding table of a row-based storage database.

## Claims

### Claim 1

A method comprising:
selecting a table of a relational database;
splitting, by a computer, the selected table by column into sub-tables, wherein at least one of the sub-tables includes at least two columns; and
writing each of the sub-tables into corresponding tables of a row-based storage database.

### Claim 2 (depends on 1)

The method of claim 1, wherein the splitting comprises:
selecting one column in the table; and
grouping the selected column together with other columns from the table according to a frequency that the selected column and the other columns are jointly accessed.

### Claim 3 (depends on 1)

The method of claim 1, wherein the writing comprises:
creating row identifiers (RID)s for each row in the table.

### Claim 4 (depends on 3)

The method of claim 3, wherein the writing further comprises:
adding the RID to each corresponding row in each of the sub-tables.

### Claim 5 (depends on 3)

The method of claim 3, wherein the writing further comprises:
specifying one of the sub-tables as a base sub-table;
adding a second RID to each row of the base sub-table; and
adding the second RID to each corresponding row of each of the sub-tables.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
indexing each of the sub-tables of the row-based storage database by using one of:
a B+ tree structure; and
a hash index;
assigning a row pointer corresponding to each row of the sub-tables to each leaf index entry; and
setting a RID value of each of the row pointers of every index entry to the RID of each corresponding row in the sub-tables of the index entry.

### Claim 7

A data processing device comprising:
a computer processor configured to perform a method comprising:
selecting a table of a relational database;
splitting the selected table by column into sub-tables, wherein at least one of the sub-tables includes at least two columns; and
writing each of the sub-tables into corresponding tables of a row-based storage database.

### Claim 8 (depends on 7)

The data processing device of claim 7, wherein the splitting comprises:
selecting one column in the table; and
grouping the selected column together with other columns from the table according to a frequency that the selected column and the other columns are jointly accessed.

### Claim 9 (depends on 7)

The data processing device of claim 7, wherein the writing comprises:
creating row identifiers (RID)s for each row in the table.

### Claim 10 (depends on 9)

The data processing device of claim 9, wherein the writing further comprises:
adding the RID to each corresponding row in each of the sub-tables.

### Claim 11 (depends on 9)

The data processing device of claim 9, wherein the writing further comprises:
specifying one of the sub-tables as a base sub-table;
adding a second RID to each row of the base sub-table; and
adding the second RID to each corresponding row of each of the sub-tables.

### Claim 12 (depends on 7)

The data processing device of claim 7, wherein the method further comprises:
indexing each of the sub-tables of the row-based storage database by using one of:
a B+ tree structure; and
a hash index;
assigning a row pointer corresponding to each row of the sub-tables to each leaf index entry; and
setting a RID value of each of the row pointers of every index entry to the RID of each corresponding row in the sub-tables of the index entry.

### Claim 13

A computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:
computer readable program code configured for:
selecting a table of a relational database;
splitting the selected table by column into sub-tables, wherein at least one of the sub-tables includes at least two columns; and
writing each of the sub-tables into corresponding tables of a row-based storage database.

### Claim 14 (depends on 13)

The computer program product of claim 13, wherein the splitting comprises:
selecting one column in the table; and
grouping the selected column together with other columns from the table according to a frequency that the selected column and the other columns are jointly accessed.

### Claim 15 (depends on 13)

The computer program product of claim 13, wherein the writing comprises:
creating row identifiers (RID)s for each row in the table.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the writing further comprises:
adding the RID to each corresponding row in each of the sub-tables.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein the writing further comprises:
specifying one of the sub-tables as a base sub-table;
adding a second RID to each row of the base sub-table; and
adding the second RID to each corresponding row of each of the sub-tables.

### Claim 18 (depends on 13)

The computer program product of claim 13, wherein the computer readable program code is further configured for:
indexing each of the sub-tables of the row-based storage database by using one of:
a B+ tree structure; and
a hash index;
assigning a row pointer corresponding to each row of the sub-tables to each leaf index entry; and
setting a RID value of each of the row pointers of every index entry to the RID of each corresponding row in the sub-tables of the index entry.
