Order-Preserving Key Compression for In-Memory Search Trees
SIGMOD/PODS '20: International Conference on Management of Data Portland OR USA June, 2020, pp. 1601-1615, 2020.
We present the High-speed Order-Preserving Encoder (HOPE) for in-memory search trees. HOPE is a fast dictionary-based compressor that encodes arbitrary keys while preserving their order. HOPE's approach is to identify common key patterns at a fine granularity and exploit the entropy to achieve high compression rates with a small dictionar...More
PPT (Upload PPT)