Reordering Columns for Smaller Indexes
Information Sciences (2009)
- DOI: 10.1016/j.ins.2011.02.002
- arXiv: 0909.1346
Available from arxiv.org
or
Abstract
Column-oriented indexes-such as projection or bitmap indexes-are compressed by run-length encoding to reduce storage and increase speed. Sorting the tables improves compression. On realistic data sets, permuting the columns in the right order before sorting can reduce the number of runs by a factor of two or more. Unfortunately, determining the best column order is NP-hard. For many cases, we prove that the number of runs in table columns is minimized if we sort columns by increasing cardinality. Experimentally, sorting based on Hilbert space-filling curves is poor at minimizing the number of runs.
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
8 Readers on Mendeley
by Discipline
by Academic Status
50% Ph.D. Student
25% Student (Master)
13% Student (Bachelor)
by Country
25% United Kingdom
25% United States
25% Canada