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: 9693
Venue: VLDB
Year: 2008
Pagerank: 8.5455497e-05
Overall Rank: 2,558 | 82.21%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
379	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD	0.0002493527
3,544	Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores	2020	SIGMOD	6.9898874e-05
3,611	SNARF: A Learning-Enhanced Range Filter	2022	VLDB	6.9191399e-05
5,762	Oasis: An Optimal Disjoint Segmented Learned Range Filter	2024	VLDB	5.3377299e-05
8,521	The LAW theorem: Local Reads and Linearizable Asynchronous Replication	2025	VLDB	4.4937074e-05
8,724	Memento Filter: A Fast, Dynamic, and Robust Range Filter	2024	SIGMOD	4.4600996e-05
9,218	Diva: Dynamic Range Filter for Var-Length Keys and Queries	2025	VLDB	4.3702863e-05
10,137	Aeris Filter: A Strongly and Monotonically Adaptive Range Filter	2026	SIGMOD	4.1945683e-05
10,916	History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures	2024	PODS	4.1945683e-05
11,764	Write-Optimized Skip Lists	2017	PODS	4.1945683e-05
11,918	Purity: Building Fast, Highly-Available Enterprise Flash Storage from Commodity Components	2015	SIGMOD	4.1945683e-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
80	Weaving Relations for Cache Performance	2001	VLDB	0.00055721729
131	Integrating Compression and Execution in Column-Oriented Database Systems	2006	SIGMOD	0.0004370331
823	Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method	1998	VLDB	0.000162378
1,524	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00011516282
1,905	How to Barter Bits for Chronons: Compression and Bandwidth Trade Offs for Database Scans	2007	SIGMOD	0.00010138448
2,134	How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations	2006	VLDB	9.4741038e-05
7,200	Online B-Tree Merging	2005	SIGMOD	4.8030945e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,339	How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice	2025	SIGMOD	4.5434069e-05
7,218	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD	4.7982543e-05
569	Optimizing Space Amplification in RocksDB	2017	CIDR	0.00019924098
10,092	LSM-Raft: Optimizing Raft for LSM-tree Store	2026	SIGMOD	4.1945683e-05
5,236	Online Deduplication for Databases	2017	SIGMOD	5.611324e-05
3,793	Constructing and Analyzing the LSM Compaction Design Space	2021	VLDB	6.7617833e-05
379	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD	0.0002493527
3,544	Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores	2020	SIGMOD	6.9898874e-05
12,980	Why Rose Is Fast: Five Optimizations In The Design Of An Experimental Database System For Cad/Cam Applications	1987	SIGMOD	4.1945683e-05
9,998	Rosé: Flexible Replication With Strong Semantics For Partitioned Databases	2026	CIDR	4.1945683e-05