# US 2013/0275397 A1 · Table boundary detection in data blocks for compression

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

- Number: US 2013/0275397 A1
- Document ID: US20130275397A1
- Status: Published application
- Kind: A1
- Application number: 13/448,159
- Filed: 2012-04-16
- Published: 2013-10-17
- Earliest claimed: 2012-04-16
- Assignees: International Business Machines Corporation
- Inventors: Jonathan AMIT; Lilia DEMIDOV; Nir HALOWANI
- Web page: https://patentgrep.com/patent/US20130275397A1

## CPC

- G06F 16/2365: {Ensuring data consistency and integrity}
- G06F 16/1744: {using compression, e.g. sparse files}
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/24575: {using context}
- G06F 16/258: {Data format conversion from or to a database}
- G06F 16/951: Indexing; Web crawling techniques
- G06F 16/953: Querying, e.g. by the use of web search engines
- H03M 7/30: Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Data is converted into a minimized data representation using a suffix tree by sorting data streams according to symbolic representations for building table boundary formation patterns. The converted data is fully reversible for reconstruction while retaining minimal header information.

## Claims

### Claim at position 1

1-8. (canceled)

### Claim 9

A system for identifying table boundaries in data blocks for compression in a computing environment, the system comprising:
a processor device, operable in the computing environment, wherein the processor device is adapted for:
converting data into a minimized data representation using a suffix tree by sorting data streams according a plurality of symbolic representations for building table boundary formation patterns, wherein the converted data is fully reversible for reconstruction while retaining minimal header information

### Claim 10 (depends on 9)

The system of claim 9, wherein the processor device is further adapted for, in conjunction with the sorting the data streams according to the plurality of symbolic representations, replacing textual data with a first symbol and numerical data with a second symbol, wherein a third symbol is used for replacing delimiters used for separation.

### Claim 11 (depends on 10)

The system of claim 10, wherein the textual data is a sequence of characters not included in a delimiters list and a digits list, and the numerical data is a sequence of digit characters not included in the delimiters list.

### Claim 12 (depends on 9)

The system of claim 9, wherein the processor device is further adapted for, in conjunction with the sorting, matching together those of the table boundary formation patterns that are similar for identifying a longest minimized data representation table boundary formation pattern.

### Claim 13 (depends on 12)

The system of claim 12, wherein the processor device is further adapted for performing at least one of:
reordering each of the table boundary formation patterns to form an output data file, and
adding to a header of the output data file at least the table boundary formation patterns, a number of rows of the output data file, and a third symbol used for separation of the table boundary formation patterns.

### Claim 14 (depends on 10)

The system of claim 10, wherein the processor device is further adapted for, in conjunction with the sorting, performing a scanning operation according to each of the following:
searching a suffix of each of the sorted data streams for identifying a data sequence that includes the first and second symbol representing the textual and numerical data,
skipping the data that only includes the third symbol until identifying the next data sequence that includes the first and second symbol representing the textual and numerical data,
building the suffix tree for the converted data, and
eliminating each scan-order not matching the searching and the skipping.

### Claim 15 (depends on 12)

The system of claim 12, wherein the processor device is further adapted for, in conjunction with the matching, searching for node branches within the suffix tree.

### Claim 16 (depends on 9)

The system of claim 9, wherein the processor device is further adapted for performing the converting for a plurality of data type blocks.

### Claim 17

A computer program product for identifying table boundaries in data blocks for compression by a processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion for converting data into a minimized data representation using a suffix tree by sorting data streams according a plurality of symbolic representations for building table formation patterns, wherein the converted data is fully reversible for reconstruction while retaining minimal header information.

### Claim 18 (depends on 17)

The computer program product of claim 17, further including a second executable portion for, in conjunction with the sorting the data streams according to the plurality of symbolic representations, replacing textual data with a first symbol and numerical data with a second symbol, wherein a third symbol is used for replacing delimiters used for separation.

### Claim 19 (depends on 18)

The computer program product of claim 18, wherein the textual data is a sequence of characters not included in a delimiters list and a digits list, and the numerical data is a sequence of digit characters not included in the delimiters list.

### Claim 20 (depends on 17)

The computer program product of claim 17, further including a second executable portion for, in conjunction with the sorting, matching together those of the table boundary formation patterns that are similar for identifying a longest minimized data representation table boundary formation pattern.

### Claim 21 (depends on 20)

The computer program product of claim 20, further including a third executable portion for performing at least one of:
reordering each of the table boundary formation patterns to form an output data file, and
adding to a header of the output data file at least the table boundary formation patterns, a number of rows of the output data file, and a third symbol used for separation of the table boundary formation patterns.

### Claim 22 (depends on 17)

The computer program product of claim 17, further including a second executable portion for in conjunction with the sorting, performing a scanning operation according to each of the following:
searching a suffix of each of the sorted data streams for identifying a data sequence that includes the first and second symbol representing the textual and numerical data,
skipping the data that only includes the third symbol until identifying the next data sequence that includes the first and second symbol representing the textual and numerical data,
building the suffix tree for the converted data, and
eliminating each scan-order not matching the searching and the skipping.

### Claim 23 (depends on 20)

The computer program product of claim 20, further including a third executable portion for, in conjunction with the matching, searching for node branches within the suffix tree.

### Claim 24 (depends on 17)

The computer program product of claim 17, further including a second executable portion for performing the converting for a plurality of data type blocks.
