Order-Preserving Key Compression for In-Memory Search Trees - 20...

Order-Preserving Key Compression for In-Memory Search TreesHuanchen Zhang Carnegie Mellon University huanche1@cs.cmu.eduXiaoxuan Liu Carnegie Mellon University xiaoxual@andrew.cmu.eduDavid G. Andersen Carnegie Mellon Universitydga@cs.cmu.eduMichael Kaminsky BrdgAIkaminsky@cs.cmu.eduKimberly Keeton Hewlett Packard Labskimberly.keeton@hpe.comAndrew Pavlo Carnegie Mellon Universitypavlo@cs.cmu.eduABSTRACTWe present the High-speed Order-Preserving Encoder (HOPE) for in-memory search trees. HOPE is a