Exploiting Coroutines to Attack the "Killer Nanoseconds"
Summary: Compares coroutine-based and other techniques for hiding cache-miss latency in pointer-intensive hash tables, searches, Masstree, and Bw-tree. Detailed experiments expose when coroutine scheduling improves throughput and its practical tradeoffs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Christopher Jonathan (University of Minnesota)
- 2. Umar Farooq Minhas (Microsoft)
- 3. James Hunter (Microsoft)
- 4. Justin Levandoski (Microsoft)
- 5. Gor Nishanov (Microsoft)
BibTeX Citation
@article{jonathan_vldb18,
title = {{Exploiting Coroutines to Attack the "Killer Nanoseconds"}},
author = {Jonathan, Christopher and Minhas, Umar Farooq and Hunter, James and Levandoski, Justin and Nishanov, Gor},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {11},
pages = {1702--1714},
doi = {10.14778/3236187.3236216},
url = {https://doi.org/10.14778/3236187.3236216},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 27 | Database Architecture Optimized for the New Bottleneck: Memory Access | 1999 | VLDB | 0.0005158963 |
| 35 | Hekaton: SQL Server’s Memory-Optimized OLTP Engine | 2013 | SIGMOD | 0.00048001919 |
| 69 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00037950385 |
| 110 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00032700879 |
| 282 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD | 0.00022264207 |
| 964 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB | 0.00012810196 |
| 2,673 | Asynchronous Memory Access Chaining | 2016 | VLDB | 8.1482775e-05 |
| 2,925 | Interleaving with Coroutines: A Practical Approach for Robust Index Joins | 2018 | VLDB | 7.8482706e-05 |
| 3,954 | SAP HANA: The Evolution from a Modern Main-Memory Data Platform to an Enterprise Application Platform | 2013 | VLDB | 6.9026723e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,405 | CoroGraph: Bridging Cache Efficiency and Work Efficiency for Graph Algorithm Execution | 2024 | VLDB |
| 2 | 4,138 | Latch-Free Data Structures for DBMS: Design, Implementation, and Evaluation | 2013 | SIGMOD |
| 3 | 5,661 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS |
| 4 | 2,575 | Semantically-based Concurrency Control for Search Structures | 1985 | PODS |
| 5 | 9,127 | Automatic Contention Detection and Amelioration for Data-Intensive Operations | 2010 | SIGMOD |
| 6 | 10,428 | Concurrent Path-Copying Update to Tree Structures | 2026 | SIGMOD |
| 7 | 10,777 | Succinct and Fast Tiny Pointer Hash Tables | 2026 | VLDB |
| 8 | 2,673 | Asynchronous Memory Access Chaining | 2016 | VLDB |
| 9 | 2,925 | Interleaving with Coroutines: A Practical Approach for Robust Index Joins | 2018 | VLDB |
| 10 | 3,709 | CoroBase: Coroutine-Oriented Main-Memory Database Engine | 2021 | VLDB |