DBScholar

Back to papers

From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads

Summary: F2 evolves FASTER into a two-tier record-oriented KV store for large skewed, >RAM workloads, separating read-hot/write-hot data with a read-cache and a two-level hash index to cut indexing overhead for cold records. Adds latch-free concurrent log compaction and other concurrency mechanisms, achieving 2–11.9× throughput vs. prior KV stores. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
14283
Venue
VLDB
Year
2025
Pagerank
5.093636e-05
Overall Rank
11,002 | 24.52%
DOI
10.14778/3750601.3750615

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{kanellis_vldb25,
        title = {{From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads}},
        author = {Kanellis, Konstantinos and Chandramouli, Badrish and Hart, Ted and Venkataraman, Shivaram},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {12},
        pages = {4910--4923},
        doi = {10.14778/3750601.3750615},
        url = {https://doi.org/10.14778/3750601.3750615},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

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

Rank Cited Paper Year Venue Pagerank
446 Monkey: Optimal Navigable Key-Value Store 2017 SIGMOD 0.00018332392
614 Faster: A Concurrent Key-Value Store with In-Place Updates 2018 SIGMOD 0.00015720975
720 Anti-Caching: A New Approach to Database Management System Architecture 2013 VLDB 0.00014632914
831 Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging 2018 SIGMOD 0.00013748512
1,677 SkimpyStash: RAM Space Skimpy Key-Value Store on Flash-based Storage 2011 SIGMOD 0.00010032149
1,954 Chucky: A Succinct Cuckoo Filter for LSM-Tree 2021 SIGMOD 9.4208165e-05
2,043 A General-Purpose Counting Filter: Making Every Bit Count 2017 SIGMOD 9.2674387e-05
2,479 Microsoft CEP Server and Online Behavioral Targeting 2009 VLDB 8.521563e-05
2,698 Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores 2020 SIGMOD 8.2450522e-05
3,001 What Modern NVMe Storage Can Do, And How To Exploit It: High-Performance I/O for High-Performance Storage Engines 2023 VLDB 7.8673493e-05
3,054 Spooky: Granulating LSM-Tree Compactions Correctly 2022 VLDB 7.8090808e-05
3,535 TreeLine: An Update-In-Place Key-Value Store for Modern Storage 2023 VLDB 7.3333933e-05
3,773 SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy 2023 SIGMOD 7.1384476e-05
5,766 Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty 2022 VLDB 6.094771e-05
5,780 Compactionary: A Dictionary for LSM Compactions 2022 SIGMOD 6.091058e-05
6,813 Netherite: Efficient Execution of Serverless Workflows 2022 VLDB 5.7657129e-05
7,437 FASTER: An Embedded Concurrent Key-Value Store for State Management 2018 VLDB 5.6191179e-05
8,016 Two is Better Than One: The Case for 2-Tree for Skewed Data Sets 2023 CIDR 5.5070057e-05
9,635 Memory-Efficient Search Trees for Database Management Systems 2021 SIGMOD 5.2434488e-05
Previous Page 1 / 1 Next

Semantically Similar Papers