Abstract
We present an indexing structure for secondary storage based on the B + -tree, but tailored for asymmetric i/o. In contrast to the traditional B + -tree, the tree is not kept balanced at all times; rather, it is kept unbalanced to cope with the i/o asymmetry commonly found in contemporary systems. We identify when imbalance is beneficial and present the unbalanced B + -tree, or the uB + -tree, its maintenance algorithms and its variants. We evaluate the uB + -tree by comparing it to the B + -tree. Our results show that the uB + -tree is highly competitive and significantly outperforms the B + -tree in environments of asymmetric i/o.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bender, M.A., et al.: Cache-oblivious B-trees. SIAM J. Comput. 35(2) (2005)
Bonnet, P.: Making CSB+-trees processor conscious. In: DaMoN (2005)
Borthakur, D.: HDFS architecture guide (2012), http://hadoop.apache.org/common/docs/current/hdfs_design.html
Chen, G., et al.: A framework for supporting DBMS-like indexes in the cloud. In: VLDB (2011)
Chen, S., et al.: Fractal prefetching B+-trees: optimizing both cache and disk performance. In: SIGMOD (2002)
Comer, D.: The ubiquitous B-tree. ACM Computing Surveys 11 (1979)
Graefe, G.: Write-optimized B-trees. In: VLDB, pp. 672–683 (2004)
Graefe, G., Larson, P.-Å.: B-tree indexes and CPU caches. In: ICDE (2001)
Hankins, R.A., Patel, J.M.: Effect of node size on the performance of cache-conscious B+-trees. SIGMETRICS Perform. Eval. Rev. 31(1) (2003)
Hellerstein, J.M., et al.: Generalized Search Trees for Database Systems. In: VLDB (1995)
Jónsson, A.M., Jónsson, B.Þ.: Towards pB+-trees in the field: Implementation choices and performance. In: EXPDB (2006)
Koltsidas, I., Viglas, S.D.: Flashing up the storage layer. In: PVLDB, vol. 1(1) (2008)
Koltsidas, I., Viglas, S.D.: Data management over flash memory. In: SIGMOD (2011)
Koltsidas, I., Viglas, S.D.: Designing a Flash-Aware Two-Level Cache. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 153–169. Springer, Heidelberg (2011)
Lehman, P.L., Yao, S.B.: Efficient locking for concurrent operations on b-trees. ACM Trans. Database Syst. 6(4) (1981)
Li, X., et al.: A new dynamic hash index for flash-based storage. In: WAIM. IEEE Computer Society (2008)
Li, Y., et al.: Tree indexing on flash disks. In: ICDE (2009)
Lomet, D.: The evolution of effective B-tree page organization and techniques: a personal account. SIGMOD Rec. 30(3) (2001)
Nath, S., Kansal, A.: FlashDB: Dynamic self-tuning database for NAND flash. In: IPSN (2007)
Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: VLDB (1999)
Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. SIGMOD Rec. 29(2) (2000)
Viglas, S.D.: Distributed file structures in a peer-to-peer environment. In: ICDE (2007)
Wu, C.H., et al.: An efficient B-tree layer implementation for flash-memory storage systems. Trans. on Embedded Computing Sys. 6(3) (2007)
Zeinalipour-Yazti, D., et al.: Microhash: an efficient index structure for fash-based sensor devices. In: FAST. USENIX Association (2005)
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
Viglas, S.D. (2012). Adapting the B + -tree for Asymmetric I/O. In: Morzy, T., Härder, T., Wrembel, R. (eds) Advances in Databases and Information Systems. ADBIS 2012. Lecture Notes in Computer Science, vol 7503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33074-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-33074-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33073-5
Online ISBN: 978-3-642-33074-2
eBook Packages: Computer ScienceComputer Science (R0)