Method and system for tokenized stream compression

Details Method and system for tokenized stream compression Method and system for tokenized stream compression

2011-08-30

2011-08-30

Hicks, Michael (Department: 2165)

Data processing: database and file management or data structures

Data integrity

Fragmentation, compaction and compression

Reexamination Certificate

active

08010510

ABSTRACT:
A tokenized stream including n tokens, each token including two or more portions, is received and a first sort order based on a sort of a set of the first portions of the n tokens is determined. The first sort order is applied to reorder a set of the second portions of the n tokens. The above steps are repeated to determine a sort order based on a set of portions of the n tokens and to apply the sort order to another set of portions of the n tokens column until a cthset of portions been reordered by a (c−1)thsort order. The variable c is a desired number of sets to be sorted. The variables c and n are whole numbers and the n tokens are dispersed during reordering.

REFERENCES:
Nelson, “Data Compression with the Burrows-Wheeler Transform”, Dr. Dobbs Journal, Sep. 1996, Accessed online at http://dogma.net/markn/articles/bwt/bwt.htm on Nov. 7, 2010.
Bihn et al., “RadixZip: linear time compression of token streams”, VLDB '07 Proceedings of the 33rd international conference on Very large data bases, pp. 1162-1172, 2007, ACM.
Bin Muhammad, Rashid, “Radix Sort” Kent State University, Kent, OH [online] <URL: http://www.personal.kent.edu/˜rmuhamma/Algorithms/MyAlgorithms/Sorting/radixSort.htm> [retrieved Jun. 6, 2007], 2 pages.
Coenen, Franz, “Stream Tokenizing (and More File Handling)” University of Liverpool, Liverpool, UK [online] May 12, 2000 <URL: http://www.csc.liv.ac.uk/˜frans/OldLectures/COMP101/AdditionalStuff/tokenizing2.html> [retrieved Aug. 7, 2009], 7 pages.
Covington, Michael, “ET: An Efficient Tokenizer in ISO Prolog” University of Georgia, Athens, GA [online] Feb. 12, 2003 <URL: http://www.ai.uga.edu/mc/ET/et.pdf> [retrieved Aug. 7, 2009], 8 pages.
“Huffman Coding” Wikipedia, the Free Encyclopedia [online] Nov. 2004 <URL: http://en.wikipedia.org/wiki/Huffman—coding> [retrieved Mar. 25, 2009], 5 pages.
Vo, Binh Dao et al., “Using Column Dependency to Compress Tables”Proceedings of the Conference on Data Compression, Snowbird, UT, 2004, pp. 92-102.

Affiliated with

Also associated with

Rating

Method and system for tokenized stream compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for tokenized stream compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for tokenized stream compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2794553