epsilon-Cost Sharding: Scaling Hypergraph-Based Data Structures to Trillions of Keys

arXiv:2503.18397 · cs.DS · Submitted 2025-03-24 · Read on arXiv

cs.DS

Submitted: 2025-03-24

Updated: 2026-10-20

Terminology

• Hypergraph — 4× in this paper · explained in 2 episodes
• Hypergraphs — 1× in this paper · explained in 2 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing