Abstract
Nowadays, flash memory is widely used in various portable devices such as PDAs (personal digital assistants) and HPCs (handheld PCs). With the development of location-based services (LBS) provided by those portable devices, how to provide efficient spatial data management over flash-equipped LBS devices has become a critical issue in recent years. In this paper, we aim to propose an efficient flash-optimized spatial tree index, called OR-tree, to improve the queries and updates on flash-resident spatial data. The OR-tree is based on R-tree and introduces two new techniques to make the R-tree suitable for flash memory storage system. First, we employ a lazy node splitting policy by introducing overflow nodes for the leaf nodes in R-tree. Next, we redesign the algorithms of update operations to adapt the unbalanced OR-tree structure. To evaluate the performance of the OR-tree, we conduct experiments on a spatial data set gathered from the R-tree portal. We run different workloads and compare the OR-tree with other competitors on the basis of different metrics including flash page usage, flash write count, erasure count, and runtime. The experimental results show that the OR-tree outperforms the competitors considering both space efficiency and time performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wu, C.H., Chang, L.P., Kuo, T.W.: An Efficient R-tree Implementation over Flash-Memory Storage Systems. In: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems (GIS), pp.17–24 (2003)
Li, Y., He, B., Yi, K.: Tree Indexing on Flash Disks. In: Proc. ICDE (2009)
Li, Y., He, B., Luo, Q., Ke, Y.: Tree Indexing on Solid State Drivers. In: Proceedings of VLDB Endowment (2010)
Agrawal, D., Ganesan, D., Sitaraman, R., Diao, Y., Singh, S.: Lazy-adaptive tree: An Optimized Index Structure for Flash Devices. PVLDB 2(1), 361–372 (2009)
Sarwat, M., Mokbel, M.F., Zhou, X., Nath, S.: FAST: A Generic Framework for Flash-Aware Spatial Trees. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 149–167. Springer, Heidelberg (2011)
Koltsidas, I., Viglas, S.D.: Spatial Data Management over Flash Memory. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 449–453. Springer, Heidelberg (2011)
Srinivasan, B.: An Adaptive Overflow Technique to Defer Splitting in B-trees. Comp. J. 34, 416–425 (1991)
Guttman, A.: R-tree: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD Intl. Symp. on the Management of Data, pp. 45–57 (1984)
Theodoridis, Y., Sellis, T.: A Model for The Prediction of R-tree Performance. In: Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Montreal, Canada, June 3-5 (1996)
Toshiba TC58DVG02A1FT00 NAND flash chip datasheet, http://toshiba.com/taec (accessed in March 2012)
Bouganim, L., Jónsson, B., Bonnet, P.: uFLIP: Understanding Flash IO Patterns. In: CIDR (2009)
Kang, J.-U., Jo, H., Kim, J.-S., Lee, J.: A Superblock-based Flash Translation Layer for NAND Flashes Memory. In: EMSOFT 2006: Proceedings of the 6th ACM & IEEE International Conference on Embedded Software, pp. 161–170. ACM, New York (2006)
Graefe, G.: Write-optimized B-trees. In: Proc. of VLDB, pp. 672–683 (2004)
Xiang, L., Zhou, D., Meng, X.F.: A New Dynamic Hash Index for Flash-based Storage. In: Proc. of WAIM (2008)
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)
Jin, P.Q., Su, X., Li, Z., Yue, L.H.: A Flexible Simulation Environment for Flash-aware Algorithms. In: Proc. of CIKM 2009, Demo. ACM Press (2009)
Samsung Electronics. K9XXG08UXA 1G x 8 Bit / 2G x 8 Bit / 4G x 8 Bit NAND Flash Memory Data Sheet (2006)
Car.tar.gz, http://www.rtreeportal.org (accessed in March 2012)
Wu, C.H., Kuo, T.W.: An Adaptive Two-Level Management for The Flash Translation Layer in Embedded Systems. In: Proc. of IEEE/ACM ICCAD 2006, pp. 601–606 (2006)
Chang, L.P., Kuo, T.W.: Efficient Management for Large-Scale Flash-Memory Storage Systems with Resource Conservation. ACM Trans. on Storage (TOS) 1(4), 381–418 (2005)
Xiang, X.Y., Yue, L.H., Liu, Z.Z.: A Reliable B-Tree Implementation over Flash Memory. In: Proc. of ACM SAC 2008, pp. 1487-1491 (2008)
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD Intl. Symp. on the Management of Data, pp. 322–331 (1990)
Del Corso, D., Passerone, C., Reyneri, L.M., Sansoe, C., Borri, M., Speretta, S., Tranchero, M.: Architecture of a Small Low-Cost Satellite. In: 10th Euromicro Conference on Digital System Design, pp. 428–431 (2007)
Lv, Y., Li, J., Cui, B., Chen, X.: Log-Compact R-Tree: An Efficient Spatial Index for SSD. In: Xu, J., Yu, G., Zhou, S., Unland, R. (eds.) DASFAA Workshops 2011. LNCS, vol. 6637, pp. 202–213. Springer, Heidelberg (2011)
Kang, D., Jung, D.: μ-tree: An Ordered Index Structure for NAND Flash Memory. In: EMSOFT, pp. 144–153 (2007)
Manousaka, A., Manolopoulos, Y.: Fringle Analysis of 2-3 Trees with Lazy Parent Split. The Computer Journal 43(5), 420–429 (2000)
Bozanis, P., Nanopoulos, A., Manolopoulos, Y.: LR-tree: a Logarithmic Decomposable Spatial Index Method. Comput. J. 46(3), 319–331 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, N., Jin, P., Wan, S., Zhang, Y., Yue, L. (2012). OR-Tree: An Optimized Spatial Tree Index for Flash-Memory Storage Systems. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds) Data and Knowledge Engineering. ICDKE 2012. Lecture Notes in Computer Science, vol 7696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34679-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-34679-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34678-1
Online ISBN: 978-3-642-34679-8
eBook Packages: Computer ScienceComputer Science (R0)