Fast and Space-Efficient In-Memory Indexes (Hash Tables, B-trees)

Jun 30, 2023
Iceberg hash table
Data Structure
Prashant Pandey
Prashant Pandey
Assistant Professor

My research interests lie at the intersection of Systems and Algorithms. I design and build theoretically well-founded data structures for big data problems in computational biology, streaming, and file systems.

Publications

BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees
Helen Xu, Amanda Li, Brian Wheatman, Manoj Marneni, Prashant Pandey
PDF Cite Code Project
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity
Prashant Pandey, Michael Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini, Rob Johnson
PDF Cite Code Project
Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design
Prashant Pandey, Alex Conway, Joe Durie, Michael Bender, Martin Farach-Colton, Rob Johnson
PDF Cite Code Project Project Video
A General-Purpose Counting Filter: Making Every Bit Count
Prashant Pandey, Michael A. Bender, Rob Johnson, and Rob Patro
PDF Cite Code Project Project