Rose: Compressed, log-structured replication

Summary: Rose uses LSM-trees to build full replicas with sequential I/O, enabling high write throughput for write-heavy workloads. Compression uses LSM order to cut I/O, enables small pages, and provides atomic replication with high bandwidth. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9884
Venue: VLDB
Year: 2008
Pagerank: 8.0617003e-05
Overall Rank: 2,843 | 80.50%
DOI: 10.14778/1453856.1453917

Incoming Non-self Citations Over Time

Authors

1. Russell Sears (University of California Berkeley)
2. Mark Callaghan (Google)
3. Eric Brewer (University of California Berkeley)

BibTeX Citation

@article{sears_vldb08,
        title = {{Rose: Compressed, log-structured replication}},
        author = {Sears, Russell and Callaghan, Mark and Brewer, Eric},
        journal = {PVLDB},
        series = {{VLDB} '08},
        volume = {1},
        number = {1},
        pages = {526--537},
        doi = {10.14778/1453856.1453917},
        url = {https://doi.org/10.14778/1453856.1453917},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
275	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD	0.00022630189
2,698	Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores	2020	SIGMOD	8.2450522e-05
2,919	SNARF: A Learning-Enhanced Range Filter	2022	VLDB	7.9628657e-05
5,261	Oasis: An Optimal Disjoint Segmented Learned Range Filter	2024	VLDB	6.2955539e-05
6,416	Memento Filter: A Fast, Dynamic, and Robust Range Filter	2024	SIGMOD	5.8829474e-05
8,308	Diva: Dynamic Range Filter for Var-Length Keys and Queries	2025	VLDB	5.4562543e-05
8,726	The LAW theorem: Local Reads and Linearizable Asynchronous Replication	2025	VLDB	5.3766157e-05
10,426	Aeris Filter: A Strongly and Monotonically Adaptive Range Filter	2026	SIGMOD	5.093636e-05
11,137	History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures	2024	PODS	5.093636e-05
11,970	Write-Optimized Skip Lists	2017	PODS	5.093636e-05
12,117	Purity: Building Fast, Highly-Available Enterprise Flash Storage from Commodity Components	2015	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
49	Weaving Relations for Cache Performance	2001	VLDB	0.00043781096
60	Integrating Compression and Execution in Column-Oriented Database Systems	2006	SIGMOD	0.0003955489
807	Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method	1998	VLDB	0.00013884448
1,508	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00010540965
1,748	How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations	2006	VLDB	9.8480684e-05
1,950	How to Barter Bits for Chronons: Compression and Bandwidth Trade Offs for Database Scans	2007	SIGMOD	9.4271737e-05
7,804	Online B-Tree Merging	2005	SIGMOD	5.5415082e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,156	How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice	2025	SIGMOD
2	6,828	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD
3	472	Optimizing Space Amplification in RocksDB	2017	CIDR
4	10,383	LSM-Raft: Optimizing Raft for LSM-tree Store	2026	SIGMOD
5	5,021	Online Deduplication for Databases	2017	SIGMOD
6	3,005	Constructing and Analyzing the LSM Compaction Design Space	2021	VLDB
7	275	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD
8	2,698	Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores	2020	SIGMOD
9	13,178	Why Rose Is Fast: Five Optimizations In The Design Of An Experimental Database System For Cad/Cam Applications	1987	SIGMOD
10	10,144	Rosé: Flexible Replication With Strong Semantics For Partitioned Databases	2026	CIDR