20 citations · 42 across the 13 of their papers we have counts for
13 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…
KV-Tandem -- a Modular Approach to Building High-Speed LSM Storage Engines
Edward Bortnikov, Michael Azran, Asa Bornstein +11
We present~\emph{KV-Tandem}, a modular architecture for building LSM-based storage engines on top of simple, non-ordered persistent key-value stores (KVSs). KV-Tandem enables advan…
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…
Aleph Filter: To Infinity in Constant Time
Niv Dayan, Ioana-Oriana Bercea, Rasmus Pagh
Filter data structures are widely used in various areas of computer science to answer approximate set-membership queries. In many applications, the data grows dynamically, requirin…
Coconut: a scalable bottom-up approach for building data series indexes
Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos +1
Many modern applications produce massive amounts of data series that need to be analyzed, requiring efficient similarity search operations. However, the state-of-the-art data serie…
Coconut Palm: Static and Streaming Data Series Exploration Now in your Palm
Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos +1
Many modern applications produce massive streams of data series and maintain them in indexes to be able to explore them through nearest neighbor search. Existing data series indexe…
Coconut: sortable summarizations for scalable indexes over static and streaming data series
Haridimos Kondylakis, Niv Dayan, Kostas Zoumpatianos +1
Many modern applications produce massive streams of data series that need to be analyzed, requiring efficient similarity search operations. However, the state-of-the-art data serie…
Learning Key-Value Store Design
Stratos Idreos, Niv Dayan, Wilson Qin +8
We introduce the concept of design continuums for the data layout of key-value stores. A design continuum unifies major distinct data structure designs under the same model. The cr…
Garbage Collection Techniques for Flash-Resident Page-Mapping FTLs
Niv Dayan, Philippe Bonnet
Storage devices based on flash memory have replaced hard disk drives (HDDs) due to their superior performance, increasing density, and lower power consumption. Unfortunately, flash…
Modelling and Managing SSD Write-amplification
Niv Dayan, Luc Bouganim, Philippe Bonnet
How stable is the performance of your flash-based Solid State Drives (SSDs)? This question is central for database designers and administrators, cloud service providers, and SSD co…
EagleTree: Exploring the Design Space of SSD-Based Algorithms
Niv Dayan, Martin Kjaer Svendsen, Matias Bjorling +2
Solid State Drives (SSDs) are a moving target for system designers: they are black boxes, their internals are undocumented, and their performance characteristics vary across models…