Optimizing R-tree for flash memory

Expert Systems with Applications

Volumn 42, Issue 10, 2015, Pages 4676-4686

  Jin, Peiquan ^a,c   Xie, Xike ^b   Wang, Na ^a   Yue, Lihua ^a,c  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b AALBORG UNIVERSITY   (Denmark)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Buffer management; Flash memory; R tree; Spatial index

Indexed keywords

CACHE MEMORY; DECISION TREES; DIGITAL STORAGE; FORESTRY; INFORMATION MANAGEMENT; INTELLIGENT SYSTEMS; MONOLITHIC MICROWAVE INTEGRATED CIRCUITS; TREES (MATHEMATICS); VIRTUAL STORAGE;

BUFFER MANAGEMENT; CRITICAL ISSUES; INTELLIGENT TRANSPORTATION SYSTEMS; POOR PERFORMANCE; R-TREES; SIMULATION PLATFORM; SPATIAL DATA MANAGEMENT; SPATIAL INDEXES;

FLASH MEMORY;

DATA PROCESSING; INDEXING; TREES;

EID: 84923778504     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2015.01.011     Document Type: Article

References (36)

1. D. Agrawal, D. Ganesan, R. Sitaraman, Y. Diao, and S. Singh Lazy-adaptive tree: An optimized index structure for flash devices Proceedings of VLDB Endowment 2 1 2009 361 372
2. Beckmann, N., Kriegel, H., Schneider, R., & Seeger, B. (1990). The R-tree: An efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM SIGMOD international conference on management of data (pp. 322-331). New York, NY, USA.
3. Bouganim, L., Jónsson, B., & Bonnet, P. (2009), uFLIP: Understanding flash IO patterns. In Proceedings of the 4th biennial conference on innovative data systems research, Asilomar (pp. 1-12).
4. P. Bozanis, A. Nanopoulos, and Y. Manolopoulos LR-tree: A logarithmic decomposable spatial index method The Computer Journal 46 3 2003 319 331
5. S. Byun, and M. Hur An index management using CHC-cluster for flash memory databases Journal of Systems and Software 82 5 2009 825 835
6. L. Chang, and T. Kuo Efficient management for large-scale flash-memory storage systems with resource conservation ACM Transactions on Storage 1 4 2005 381 418
7. S. Chawla, and P. Sun SLOM: A new measure for local spatial outliers Knowledge and Information Systems 9 4 2006 412 429
8. E. Gal, and S. Toledo Algorithms and data structures for flash memories ACM Computing Surveys 37 2 2005 138 163
9. Y. Gao, Q. Liu, B. Zheng, and G. Chen On efficient reverse skyline query processing Expert Systems with Applications 41 7 2014 3237 3249
10. Graefe, G. (2004), Write-optimized B-trees. In Proceedings of the thirtieth international conference on very large data bases (pp. 672-683). Toronto, Canada.
11. Guttman, A. (1984), R-trees: A dynamic index structure for spatial searching. In Proceedings of international conference on management of data (pp. 47-57). New York.
12. P. Jin, Y. Ou, T. Härder, and Z. Li AD-LRU: An efficient buffer replacement algorithm for flash-based databases Data and Knowledge Engineering 72 2012 83 102
13. Jin, P., Su, X., Li, Z., & Yue, L. (2009). A flexible simulation environment for flash-aware algorithms. In Proceedings of the 18th ACM conference on information and knowledge management (pp. 2093-2094). New York, NY, USA.
14. Jin, P., Yang, P., & Yue, L. (2015). Optimizing B+ tree for hybrid storage systems, distributed and parallel databases, Online, http://dx.doi.org/10.1007/s10619-014-7157-7.
15. Kang, J., Jo, H., Kim, J., & Lee, J. (2006). A superblock-based flash translation layer for NAND flash memory. In Proceedings of the 6th international conference on embedded software (pp. 161-170). New York, NY, USA.
16. Kang, D., Jung, D., Kang, J., & Kim, J. (2007), μ-tree: An ordered index structure for NAND flash memory. In Proceedings of the 7th ACM and IEEE international conference on embedded software (pp. 144-153). New York, NY, USA.
17. Koltsidas, I., &Viglas, S. D. (2011), Spatial data management over flash memory. In Proceedings of the 12th international conference on advances in spatial and temporal databases (pp. 449-453).
18. Li, Y., He, B., Luo, Q., & Yi, K. (2009). Tree indexing on flash disks. In Proceedings of IEEE 25th international conference on data engineering (pp. 1303-1306).
19. Y. Li, B. He, R. Yang, Q. Luo, and K. Yi Tree indexing on solid state drives Proceedings of VLDB Endowment 3 1 2010 1195 1206
20. Z. Li, P. Jin, X. Su, K. Cui, and L. Yue CCF-LRU: A new buffer replacement algorithm for flash memory IEEE Transactions on Consumer Electronics 55 3 2009 1351 1359
21. Lv, Y., Li, J., Cui, B., & Chen, X. (2011). Log-compact R-tree: An efficient spatial index for SSD. In Proceedings of the 16th international conference on database systems for advanced applications (pp. 202-213). Berlin, Heidelberg.
22. A. Manousaka, and Y. Manolopoulos Fringe analysis of 2-3 trees with lazy parent split The Computer Journal 43 5 2000 420 429
23. Ou, Y., Härder, T., & Jin, P. (2009), CFDC: A flash-aware replacement policy for database buffer management. In Proceedings of the fifth international workshop on data management on new hardware (pp. 15-20). Providence, Rhode Island, USA.
24. J. Ouyang, S. Lin, J. Song, Z. Hou, Y. Wang, and Y. Wang SDF: Software-defined flash for web-scale internet storage systems Proceedings of ASPLOS 2014 471 484
25. K. Park Location-based grid-index for spatial query processing Expert Systems with Applications 41 4 2014 1294 1300
26. Sarwat, M., Mokbel, M., Zhou, X., & Nath, S. (2011), FAST: A generic framework for flash-aware spatial trees. In Proceedings of the 12th international conference on advances in spatial and temporal databases (pp. 149-167). Berlin, Heidelberg.
27. M. Sarwat, M. Mokbel, X. Zhou, and S. Nath Generic and efficient framework for search trees on flash memory storage systems Geoinformatica 17 3 2013 417 448
28. B. Srinivasan An adaptive overflow technique to defer splitting in B-trees The Computer Journal 34 5 1991 397 405
29. Theodoridis, Y., & Sellis, T. (1996). A model for the prediction of R-tree performance. In Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (pp. 161-171). New York, NY, USA.
30. Wu, C., Chang, L., & Kuo, T. (2003). An efficient R-tree implementation over flash-memory storage systems. In Proceedings of the 11th ACM international symposium on advances in geographic information systems (pp. 17-24). New York, NY, USA.
31. Wu, C., Chang, L., & Kuo, T. (2004). An efficient B-tree layer for flash-memory storage systems. In Proceedings of the 9th international conference on real-time and embedded computing systems and applications (pp. 409-430).
32. Wu, C., & Kuo, T. (2006). An adaptive two-level management for the flash translation layer in embedded systems. In Proceedings of international conference on computer-aided design (pp. 601-606). San Jose, California, USA.
33. Xiang, X., Yue, L., Liu, Z., & Wei, P. (2008). A reliable B-tree implementation over flash memory. In Proceedings of the 2008 ACM symposium on applied computing (pp. 1487-1491). New York, NY, USA.
34. Yang, C., Jin, P., Yue, L., & Yang, P. (2015). Efficient buffer management for tree indices on solid state drives, International Journal of Parallel Programming, Online, http://dx.doi.org/10.1007/s10766-014-0340-7.
35. Zhang, X., Jin, P., Lin, S., & Yue, L. (2014). Leveraging focused locations for web search. In Proceedings of WAIM. LNCS (Vol. 8485, pp. 835-838).
36. J. Zhao, P. Jin, Q. Zhang, and R. Wen Exploiting location information for web search Computer in Human Behaviors 30 2014 378 388