Table boundary detection in data blocks for compression

1. 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;

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.

2. The system of claim 1 , 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.

3. The system of claim 2 , 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.

4. The system of claim 1 , 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.

5. The system of claim 4 , 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.

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

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

8. 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;

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.

9. The computer program product of claim 8 , 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.

10. The computer program product of claim 9 , 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.

11. The computer program product of claim 8 , 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.

12. The computer program product of claim 11 , 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.

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

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