Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Fast Sparse -Navigable Graph Construction with Improved Resource Augmentation
Alex Conway, Laxman Dhulipala, Martin Farach-Colton +5
Graph-based nearest neighbor search methods, which run greedy search on a directed graph over the data points, have surged in popularity in recent years. A common goal is to constr…
cs.DS2026
Bounding the Fragmentation of B-Trees Subject to Batched Insertions
Michael A. Bender, Aaron Bernstein, Nairen Cao +5
The issue of internal fragmentation in data structures is a fundamental challenge in database design. A seminal result of Yao in this field shows that evenly splitting the leaves o…