14 citations · 34 across the 3 of their papers we have counts for
3 papers
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
Harsha Vardhan Simhadri, George Williams, Martin Aumüller +9
Despite the broad range of algorithms for Approximate Nearest Neighbor Search, most empirical evaluations of algorithms have focused on smaller datasets, typically of 1 million poi…
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy +1
Approximate nearest neighbor search (ANNS) is a fundamental building block in information retrieval with graph-based indices being the current state-of-the-art and widely used in t…
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy
Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya +3
Data redundancy provides resilience in large-scale storage clusters, but imposes significant cost overhead. Substantial space-savings can be realized by tuning redundancy schemes t…