The Future of Database Management: An Interview with CMU’s Andy Pavlo

This post introduces the Succinct Range Filter (SuRF), a novel data structure that combines the fast point query capabilities of Bloom filters with approximate range query support. SuRF is engineered for performance and uses a succinct trie encoding to achieve low memory overhead (around 12 bits per 64-bit integer key for a 1% false positive rate). The post also discusses the potential long-term effects of ML on DBMS design and the trend towards shared-disk distributed DBMS architectures that can scan data in situ from various formats like Parquet, ORC, and JSON.