20 citations · 28 across the 9 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…