Lazy-adaptive tree: An optimized index structure for flash devices

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 361-372

  Agrawal, Devesh ^a   Ganesan, Deepak ^a   Sitaraman, Ramesh ^a   Diao, Yanlei ^a   Singh, Shashi ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84859389785     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687669     Document Type: Article

References (25)

1. L. Arge. The buffer tree: A Technique for Designing Batched External Data Structures. In Algorithmica 37(1):1-24, 2003.
2. L. Arge, K. Hinrichs et al. Efficient bulk operations on dynamic R-trees. In Algorithmica 33(1):104-128, 2002.
3. A. Birrell, M. Isard et al. A Design for High Performance Flash Disks. In SIGOPS Operating system review, 41(2), 2007.
4. N. Agrawal, V. Prabhakaran et al. Design Tradeoffs for SSD Performance. In USENIX 2008.
5. Y. Diao, D. Ganesan et al. Rethinking data management for storage-centric sensor networks. In CIDR 2007.
6. MSP-SATA7525. http://mtron.net/Upload_Data/Spec/ASIC/PRO/SATA/MSP-SATA7525_rev0.4.pdf
7. J. Gray, and B. Fitzgerald. Flash Disk Opportunity for Server Applications. In ACM Queue 2008 4(6).
8. Enea polyhedra flashlite. http://www.enea.com.
9. G. Mathur, P. Desnoyers et al. Ultra-Low Power Data Storage for Sensor Networks. In IPSN-SPOTS, 2006.
10. G. Graefe. The Five-minute Rule Twenty Years Later, and How Flash Memory Changes the Rules. In DAMON 2007.
11. J.M. Hellerstein, J.F. Naughton et al. Generalized Search Trees for Database Systems. In VLDB, 1995.
12. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica, 17, 1982.
13. H-Store: A Next Generation OLTP DBMS. http://db.cs.yale.edu/hstore/.
14. J.-U. Kang, H. Jo et al. A superblock-based flash translation layer for nand flash memory. In EMSOFT 2006.
15. D. Kang, D. Jung et al. μ-tree: an ordered index structure for NAND flash memory. In EMSOFT 2007.
16. A. Borodin and E. Y. Ran. Online computation and competitive analysis. Published by Cambridge University Press, 1998
17. I. Koltsidas, S. D. Viglas. Flashing Up the Storage Layer. In VLDB 2008.
18. S. Lee and B. Moon. Design of flash-based DBMS: an in-page logging approach. In SIGMOD 2007.
19. S. Lee, B. Moon et al. A Case for Flash Memory SSD in Enterprise Database Applications. In SIGMOD 2008.
20. Y. Li, B. He et al. Tree Indexing on Flash Disks. In ICDE 2009.
21. S. Nath and A. Kansal. FlashDB: dynamic self-tuning database for NAND flash. In IPSN 2007.
22. Toshiba TC58DVG02A1FT00 NAND flash chip datasheet. http://toshiba.com/taec, 2003.
23. C. Wu, T. Wei, and L. P. Chang. An efficient B-tree layer implementation for flash-memory storage systems. Trans. on Embedded Computing Systems, 6(3), 2007.
24. J. Zhou and K. A. Ross. Buffering accesses to memory-resident index structures. In VLDB 2003.
25. D. Agrawal, S. Singh, D. Ganesan, R. Sitaraman, and Y. Diao. Flash-Optimized Index Structures for Embedded Systems. TR 2008-08, UMass Amherst CS Dept, 2008.