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