Abstract
Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database environments. A Cache Sensitive B+-Tree is one of them. It is designed to minimize the impact of cache misses for B+-Trees and it has been known to be more effective than other types of main memory index structure including T-Trees. In this paper, we introduce a Cache Sensitive T-Tree (CST-Tree) and show how T-Trees can also be redesigned to be cache sensitive. We present an experimental performance study which shows that our Cache Sensitive T-Trees can outperform the original T-Trees and Cache Sensitive B+-Trees on average 65 percent and 17 percent, respectively.
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
Ailamaki, A., et al.: DBMSs On A Modern Processor: Where Does Time Go? In: Proc. of the 25th Int’l Conf. on Very Large Database Systems, pp. 266–277 (1999)
Bohannon, P., et al.: Main-Memory Index Structures with Fixed-Size Partial Keys. In: Proc. of the 2001 ACM SIGMOD Int’l Conf. on Management of Data, pp. 163–174 (2001)
Boncz, P., et al.: Database Architecture Optimized for the new Bottleneck: Memory Access. In: Proc. of the 19th Int’l Conf. on Very Large Database Systems, pp. 54–65 (1999)
Chilimbi, T.M., Davidson, B., Larus, J.R.: Cache-Conscious Structure Definition. In: Proc. of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pp. 13–24 (1999)
Cormen, T.H., et al.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Lehman, T.J.: A Study of Index Structures for Main Memory Database Management System. In: Proc. of the 12th Int’l Conf. on Very Large Database Systems, pp. 294–303 (1986)
Manegold, S., Boncz, P.A., Kersten, M.L.: Optimizing database architecture for the new bottleneck: memory access. VLDB Journal 9(3), 231–246 (2000)
Rao, J., et al.: Cache Conscious Indexing for Decision-Support in Main Memory. In: Proc. of the 19th Int’l Conf. on Very Large Database Systems, pp. 78–89 (1999)
Rao, J., et al.: Making B+ Trees Cache Conscious in Main Memory. In: Proc. of the 2000 ACM SIGMOD Int’l Conf. on Management of Data, pp. 475–486 (2000)
Sun Microsystems, Inc.: Sun ONE Studio 8: Program Performance Analysis Tools (2003), available via http://docs.sun.com/app/docs/doc/817-0922
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, Ih., Shim, J., Lee, Sg., Chun, J. (2007). CST-Trees: Cache Sensitive T-Trees. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)