Advertisement

Log-Compact R-Tree: An Efficient Spatial Index for SSD

  • Yanfei Lv
  • Jing Li
  • Bin Cui
  • Xuexuan Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6637)

Abstract

R-Tree structure is widely adopted as a general spatial index with the assumption that the deployed system is equipped with magnetic hard disk. While the application of SSD becomes more and more popular, traditional optimization of R-Tree structure on SSD is much less desirable than that on magnetic hard disk. Existing flash-aware index approaches employ log mechanism to reduce random writes at a cost of large amount of read. A novel index named Log Compact R-Tree (LCR-tree) is proposed in this paper. Distinguished from previous attempts, compacted log is introduced to combine newly arrival log with origin ones on the same node, which renders great decrement of random writes with at most one additional read for each node access. Extensive experiments illustrate that the proposed LCR-Tree can achieve up to 3 times benefit against existing approaches.

Keywords

Index Structure Node Size Read Operation Spatial Index Solid State Drive 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, D., Ganesan, D., Sitaraman, R.K., Diao, Y., Singh, S.: Lazy-Adaptive Tree. An optimized index structure for flash devices. PVLDB 2(1), 361–372 (2009)Google Scholar
  2. 2.
    Bouganim, L., Jónsson, B.T., Bonnet, P.: uFLIP: Understanding flash io patterns. In: CIDR (2009)Google Scholar
  3. 3.
    Chen, F., Koufaty, D.A., Zhang, X.: Understanding intrinsic characteristics and system implications of flash memory based solid state drives. In: SIGMETRICS/Performance, pp. 181–192 (2009)Google Scholar
  4. 4.
    Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47–57 (1984)Google Scholar
  5. 5.
    Kang, D., Jung, D., Kang, J.U., Kim, J.S.: mu-tree: an ordered index structure for nand flash memory. In: EMSOFT, pp. 144–153 (2007)Google Scholar
  6. 6.
    Kim, Y.R., Whang, K.Y., Song, I.Y.: Page-differential logging: an efficient and dbms-independent approach for storing data into flash memory. In: SIGMOD Conference, pp. 363–374 (2010)Google Scholar
  7. 7.
    Koltsidas, I., Viglas, S.: Flashing up the storage layer. PVLDB 1(1), 514–525 (2008)Google Scholar
  8. 8.
    Lee, S.W., Moon, B.: Design of flash-based DBMS: an in-page logging approach. In: SIGMOD Conference, pp. 55–66 (2007)Google Scholar
  9. 9.
    Lee, S.W., Moon, B., Park, C., Kim, J.M., Kim, S.W.: A case for flash memory ssd in enterprise database applications. In: SIGMOD Conference, pp. 1075–1086 (2008)Google Scholar
  10. 10.
    Li, X., Zhou, D., Meng, X.: A new dynamic hash index for flash-based storage. In: WAIM, pp. 93–98 (2008)Google Scholar
  11. 11.
    Li, Y., He, B., Yang, J., Luo, Q., Yi, K.: Tree indexing on solid state drives. PVLDB 3(1), 1195–1206 (2010)Google Scholar
  12. 12.
    Li, Y., He, B., Luo, Q., Yi, K.: Tree indexing on flash disks. In: ICDE, pp. 1303–1306 (2009)Google Scholar
  13. 13.
  14. 14.
    Na, G.J., Lee, S.W., Moon, B.: Dynamic in-page logging for flash-aware b-tree index. In: CIKM, pp. 1485–1488 (2009)Google Scholar
  15. 15.
    Na, G.J., Moon, B., Lee, S.W.: In-page logging B-tree for flash memory. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 755–758. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  16. 16.
    Nath, S., Kansal, A.: FlashDB: dynamic self-tuning database for nand flash. In: IPSN, pp. 410–419 (2007)Google Scholar
  17. 17.
    Portal, R.T.: Spatial (geographical) Datasets, http://www.rtreeportal.org
  18. 18.
  19. 19.
    Wu, C.-H., Chang, L.-P., Kuo, T.-W.: An efficient B-tree layer for flash-memory storage systems. In: Chen, J., Hong, S. (eds.) RTCSA 2003. LNCS, vol. 2968, pp. 409–430. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  20. 20.
    Wu, C.H., Chang, L.P., Kuo, T.W.: An efficient r-tree implementation over flash-memory storage systems. In: GIS, pp. 17–24 (2003)Google Scholar
  21. 21.
    Yin, S., Pucheral, P., Meng, X.: Pbfilter: indexing flash-resident data through partitioned summaries. In: CIKM, pp. 1333–1334 (2008)Google Scholar
  22. 22.
    Zeinalipour-Yazti, D., Lin, S., Kalogeraki, V., Gunopulos, D., Najjar, W.A.: MicroHash: An efficient index structure for flash-based sensor devices. In: FAST (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yanfei Lv
    • 1
    • 2
  • Jing Li
    • 1
    • 2
  • Bin Cui
    • 1
  • Xuexuan Chen
    • 1
    • 2
  1. 1.School of Electronics Engineering and Computer SciencePeking UniversityChina
  2. 2.Key Lab of High Confidence Software Technologies (Ministry of Education)Peking UniversityChina

Personalised recommendations