B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives
Summary: Exploits internal flash-SSD parallelism with a psync I/O primitive, yielding a B+-tree variant (PIO B-tree). Shows insert up to 16.3x, point-search 1.2x, and 5x range search; outperforms flash-aware indexes and PostgreSQL/TPC-C traces. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hongchan Roh (Yonsei University)
- 2. Sanghyun Park (Yonsei University)
- 3. Sungho Kim (Yonsei University)
- 4. Mincheol Shin (Yonsei University)
- 5. Sang-Won Lee (Sungkyunkwan University)
BibTeX Citation
@article{roh_vldb12,
title = {{B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives}},
author = {Roh, Hongchan and Park, Sanghyun and Kim, Sungho and Shin, Mincheol and Lee, Sang-Won},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {4},
pages = {286--297},
doi = {10.14778/2095686.2095687},
url = {https://doi.org/10.14778/2095686.2095687},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,492 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010588267 |
| 4,894 | Optimizing Databases by Learning Hidden Parameters of Solid State Drives | 2020 | VLDB | 6.4562316e-05 |
| 7,135 | SaS: SSD as SQL Database System | 2021 | VLDB | 5.6940523e-05 |
| 7,996 | When Database Meets New Storage Devices: Understanding and Exposing Performance Mismatches via Configurations | 2023 | VLDB | 5.5096162e-05 |
| 8,800 | Parallel I/O Aware Query Optimization | 2014 | SIGMOD | 5.3691168e-05 |
| 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 5.214913e-05 |
| 10,212 | Concurrent Path-Copying Update to Tree Structures | 2026 | SIGMOD | 5.093636e-05 |
| 10,468 | LiveBin: A Localized and Version-Aware Binned Scan Index | 2026 | SIGMOD | 5.093636e-05 |
| 10,489 | RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage | 2026 | SIGMOD | 5.093636e-05 |
| 11,011 | From Scale-Up to Scale-Out: PolarDB’s Journey to Achieving 2 Billion tpmC | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 488 | Design of Flash-Based DBMS: An In-Page Logging Approach | 2007 | SIGMOD | 0.00017615543 |
| 512 | Tree Indexing on Solid State Drives | 2010 | VLDB | 0.00017196795 |
| 4,893 | Page-Differential Logging: An Efficient and DBMS-Independent Approach for Storing Data into Flash Memory | 2010 | SIGMOD | 6.4565717e-05 |
| 5,165 | Advances in Flash Memory SSD Technology for Enterprise Database Applications | 2009 | SIGMOD | 6.3371139e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,255 | B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases | 2023 | VLDB |
| 2 | 1,567 | Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance | 2002 | SIGMOD |
| 3 | 6,139 | Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDs | 2021 | VLDB |
| 4 | 1,508 | Sorting And Indexing With Partitioned B-Trees | 2003 | CIDR |
| 5 | 7,189 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 6 | 2,020 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 7 | 10,829 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 8 | 1,455 | Query Processing Techniques for Solid State Drives | 2009 | SIGMOD |
| 9 | 545 | Improving Index Performance through Prefetching | 2001 | SIGMOD |
| 10 | 512 | Tree Indexing on Solid State Drives | 2010 | VLDB |