activity
20122026
most citedProteus: A Self-Designing Range Filter

31 citations · 74 across the 15 of their papers we have counts for

collaborators
Showing cs.DBShow all

10 papers · 1 filter

cs.DB2025

How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice

Dingheng Mo, Siqiang Luo, Stratos Idreos

LSM-tree based key-value stores are widely adopted as the data storage backend in modern big data applications. The LSM-tree grows with data ingestion, by either adding levels with…

cs.DB2025★ 3 cited

The Cambridge Report on Database Research

Anastasia Ailamaki, Samuel Madden, Daniel Abadi +43

On October 19 and 20, 2023, the authors of this report convened in Cambridge, MA, to discuss the state of the database research field, its recent accomplishments and ongoing challe…

cs.DB2022★ 3 cited

The Case for Distributed Shared-Memory Databases with RDMA-Enabled Memory Disaggregation

Ruihong Wang, Jianguo Wang, Stratos Idreos +2

Memory disaggregation (MD) allows for scalable and elastic data center design by separating compute (CPU) from memory. With MD, compute and memory are no longer coupled into the sa…

cs.DB2022★ 31 cited

Proteus: A Self-Designing Range Filter

Eric R. Knorr, Baptiste Lemaire, Andrew Lim +4

We introduce Proteus, a novel self-designing approximate range filter, which configures itself based on sampled data in order to optimize its false positive rate (FPR) for a given…

cs.DB2021★ 2 cited

Real-Time LSM-Trees for HTAP Workloads

Hemant Saxena, Lukasz Golab, Stratos Idreos +1

Real-time analytics systems employ hybrid data layouts in which data are stored in different formats throughout their lifecycle. Recent data are stored in a row-oriented format to…

cs.DB2019★ 2 cited

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…

cs.DB2018

The Internals of the Data Calculator

Stratos Idreos, Kostas Zoumpatianos, Brian Hentschel +2

Data structures are critical in any data-driven scenario, but they are notoriously hard to design due to a massive design space and the dependence of performance on workload and ha…

cs.DB2017★ 5 cited

Evolutionary Data Systems

Stratos Idreos, Lukas M. Maas, Mike S. Kester

Anyone in need of a data system today is confronted with numerous complex options in terms of system architectures, such as traditional relational databases, NoSQL and NewSQL solut…

cs.DB2012★ 4 cited

Concurrency Control for Adaptive Indexing

Goetz Graefe, Felix Halim, Stratos Idreos +2

Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query processing. The goal is to achieve the benefits of indexes while hiding or minimizing t…

cs.DB2012★ 8 cited

Stochastic Database Cracking: Towards Robust Adaptive Indexing in Main-Memory Column-Stores

Felix Halim, Stratos Idreos, Panagiotis Karras +1

Modern business applications and scientific databases call for inherently dynamic data storage environments. Such environments are characterized by two challenging features: (a) th…