Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices
Summary: LA-Tree is a lazy, cascaded-buffer index for flash devices that amortizes node reads/writes. An online adaptive algorithm tunes buffer sizes and flash-aware memory management with reclamation; under the NAND cost model it is optimal, delivering 2x–12x NAND gains and 3x–6x on SSDs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Devesh Agrawal
- 2. Deepak Ganesan
- 3. Ramesh Sitaraman
- 4. Yanlei Diao
- 5. Shashi Singh
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 |
|---|---|---|---|---|
| 242 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00031093647 |
| 347 | Design of Flash-Based DBMS: An In-Page Logging Approach | 2007 | SIGMOD | 0.0002656744 |
| 492 | A Case for Flash Memory SSD in Enterprise Database Applications | 2008 | SIGMOD | 0.0002178745 |
| 1,061 | Flashing Up the Storage Layer | 2008 | VLDB | 0.0001435824 |
| 1,195 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB | 0.00013404419 |
| 4,501 | Rethinking Data Management for Storage-centric Sensor Networks | 2007 | CIDR | 6.1325842e-05 |
Previous
Page 1 / 1
Next