TABLE BOUNDARY DETECTION IN DATA BLOCKS FOR COMPRESSION

摘要

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. A scanning operation is performed by searching a suffix of each of the sorted data streams for identifying a data sequence that includes a first symbol representing textual data, and a second symbol representing numerical data. The suffix tree for the converted data is then built.

主权项

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:
converts data into a minimized data representation using a suffix tree by sorting data streams according to 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; andperforms a scanning operation according to each of the following:
searches a suffix of each of the sorted data streams for identifying a data sequence that includes a first symbol representing textual data and a second symbol representing numerical data, andbuilds the suffix tree for the converted data.