13 citations · 13 across the 4 of their papers we have counts for
5 papers
A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search
Sajad Faghfoor Maghrebi, Navid Eslami, Niv Dayan
Most vector databases rely on graph-based indexes, notably HNSW and Vamana, for approximate nearest neighbor search. With embedding models widely adopted, the datasets these databa…
Diva++: Dynamic Range Filtering over Hard Workloads
Navid Eslami, Ioana O. Bercea, Niv Dayan
Range filters are compact probabilistic data structures that answer approximate range emptiness queries. They are used in many domains, e.g., in key-value stores, to quickly rule o…
Sublime: Sublinear Error & Space for Unbounded Skewed Streams
Navid Eslami, Ioana O. Bercea, Rasmus Pagh +1
Modern stream processing systems often need to track the frequency of distinct keys in a data stream in real-time. Since maintaining exact counts can require a prohibitive amount o…
Memento Filter: A Fast, Dynamic, and Robust Range Filter
Navid Eslami, Niv Dayan
Range filters are probabilistic data structures that answer approximate range emptiness queries. They aid in avoiding processing empty range queries and have use cases in many appl…
Locality in online, dynamic, sequential, and distributed graph algorithms
Amirreza Akbari, Navid Eslami, Henrik Lievonen +3
In this work, we give a unifying view of locality in four settings: distributed algorithms, sequential greedy algorithms, dynamic algorithms, and online algorithms. We introduce a…