Reordering rows for better compression: Beyond the lexicographic order
Abstrak
Sorting database tables before compressing them improves the compression rate. Can we do better than the lexicographical order? For minimizing the number of runs in a run-length encoding compression scheme, the best approaches to row-ordering are derived from traveling salesman heuristics, although there is a significant trade-off between running time and compression. A new heuristic, Multiple Lists, which is a variant on Nearest Neighbor that trades off compression for a major running-time speedup, is a good option for very large tables. However, for some compression schemes, it is more important to generate long runs rather than few runs. For this case, another novel heuristic, Vortex, is promising. We find that we can improve run-length encoding up to a factor of 3 whereas we can improve prefix coding by up to 80%: these gains are on top of the gains due to lexicographically sorting the table. We prove that the new row reordering is optimal (within 10%) at minimizing the runs of identical values within columns, in a few cases.
Topik & Kata Kunci
Penulis (3)
D. Lemire
Owen Kaser
E. Gutarra
Akses Cepat
- Tahun Terbit
- 2012
- Bahasa
- en
- Total Sitasi
- 34×
- Sumber Database
- Semantic Scholar
- DOI
- 10.1145/2338626.2338633
- Akses
- Open Access ✓