Lazy-Adaptive Tree
- 1 August 2009
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 2 (1), 361-372
- https://doi.org/10.14778/1687627.1687669
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Flash Disk Opportunity for Server ApplicationsQueue, 2008
- A case for flash memory ssd in enterprise database applicationsPublished by Association for Computing Machinery (ACM) ,2008
- The five-minute rule twenty years later, and how flash memory changes the rulesPublished by Association for Computing Machinery (ACM) ,2007
- Design of flash-based DBMSPublished by Association for Computing Machinery (ACM) ,2007
- A design for high-performance flash disksACM SIGOPS Operating Systems Review, 2007
- FlashDBPublished by Association for Computing Machinery (ACM) ,2007
- μ-treePublished by Association for Computing Machinery (ACM) ,2007
- Ultra-low power data storage for sensor networksPublished by Association for Computing Machinery (ACM) ,2006
- A superblock-based flash translation layer for NAND flash memoryPublished by Association for Computing Machinery (ACM) ,2006
- Efficient Bulk Operations on Dynamic R-TreesAlgorithmica, 2002