Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices
Summary: LA-Tree is a flash-optimized index using cascaded lazy-update buffers to amortize node I/O. An online algorithm adapts buffer sizes optimally under a raw-NAND cost model, with reclamation and memory management yielding 2–12× gains. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Devesh Agrawal (University of Massachusetts Amherst)
- 2. Deepak Ganesan (University of Massachusetts Amherst)
- 3. Ramesh Sitaraman (University of Massachusetts Amherst)
- 4. Yanlei Diao (University of Massachusetts Amherst)
- 5. Shashi Singh (University of Massachusetts Amherst)
BibTeX Citation
@article{agrawal_vldb09,
title = {{Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices}},
author = {Agrawal, Devesh and Ganesan, Deepak and Sitaraman, Ramesh and Diao, Yanlei and Singh, Shashi},
journal = {PVLDB},
series = {{VLDB} '09},
doi = {10.14778/1687627.1687669},
url = {https://doi.org/10.14778/1687627.1687669},
year = {2009}
}
Incoming Citations (Sorted by Pagerank)
Showing 20 of 20 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 202 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00025454884 |
| 488 | Design of Flash-Based DBMS: An In-Page Logging Approach | 2007 | SIGMOD | 0.00017615543 |
| 561 | A Case for Flash Memory SSD in Enterprise Database Applications | 2008 | SIGMOD | 0.00016525248 |
| 999 | Flashing Up the Storage Layer | 2008 | VLDB | 0.00012740138 |
| 1,110 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB | 0.00012140661 |
| 4,698 | Rethinking Data Management for Storage-centric Sensor Networks | 2007 | CIDR | 6.5569539e-05 |
Previous
Page 1 / 1
Next