PDL Abstract

SuRF: Practical Range Query Filtering with Fast Succinct Tries

SIGMOD’18, June 10–15, 2018, Houston, TX, USA. BEST PAPER AWARD!

Huanchen Zhang, Hyeontaek Lim, Viktor Leis*, David G. Andersen, Michael Kaminsky^, Kimberly Keeton†, Andrew Pavlo

Carnegie Mellon University
* TU München
^ Intel Labs
† Hewlett Packard Enterprise

http://www.pdl.cmu.edu/

We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries: open-range queries, closed-range queries, and range counts. SuRF is based on a newdata structure called the Fast Succinct Trie (FST) that matches the point and range query performance of state-of-the-art order-preserving indexes, while consuming only 10 bits per trie node. The false positive rates in SuRF for both point and range queries are tunable to satisfy different application needs. We evaluate SuRF in RocksDB as a replacement for its Bloom filters to reduce I/O by filtering requests before they access on-disk data structures. Our experiments on a 100 GB dataset showthat replacing RocksDB’s Bloom filters with SuRFs speeds up open-seek (without upper-bound) and closed-seek (with upper-bound) queries by up to 1.5× and 5× with a modest cost on the worst-case (all-missing) point query throughput due to slightly higher false positive rate.

FULL PAPER: pdf