Database
bwt.asc
Associated article: Data Compression with the Burrows Wheeler Transform
Tags: Database
Published examples by Mark R. Nelson in his article which examines the Burrows-Wheeler Transform--an algorithm that takes a block of data and rearranges it using a sorting algorithm. The resulting output block contains exactly the same data elements that it started with, differing only in their ordering.
_Data Compression with the Burrows-Wheeler Transform_
by Mark R. Nelson
Example 1:
int T[] = { 1, 6, 4, 5, 0, 2, 3 };
char L[] = "OBRSDDB";
int primary_index = 5;
. . .
int index = primary_index;
for ( int i = 0 ; i < 7 ; i++ ) {
cout << L[ index ];
index = T[ index ];
}
Figure 7:
...
