2 citations · 3 across the 5 of their papers we have counts for
Showing 2026 · cs.DBShow all
3 papers · 2 filters
cs.DB2026
Building Navigable Graphs Without Search in Three Composable Stages
Édgar Chávez
Navigable graphs can be built without searching for neighbors: partition the data, evaluate every pair inside each part, and select each point's edges from the candidates. We give…
cs.DB2026
SOLO: Certified-Recall Metric Similarity Search with Scan-Only Sampled Inverted Lists
Édgar Chávez
In every fast nearest-neighbor index, recall is measured, never predicted: each operating point is tuned by serving it against ground truth. SOLO is an index whose recall is comput…
cs.DB2026
Batched Feedback and the Random-Access Wall in Search-Based Graph Construction
Édgar Chávez
Navigable graphs for nearest-neighbor search are built either incrementally, each inserted point searching a graph that mutates as construction proceeds, or in batch over a fixed s…