Cache Sensitive T-tree Index Structure
![]() |
Lee Ig-hoon
(서울대학교 컴퓨터공학부)
Kim Hyun Chul (서울대학교 컴퓨터공학부) Hur Jae Yung ((주)유엔젤) Lee Snag-goo (서울대학교 컴퓨터공학부) Shim JunHo (숙명여자대학교 정보과학부) Chang Juho (상명대학교 미디어학부) |
1 | Sun MicroSystems, SHADE 1.7.3 BETA, available via 'http://wwws.sun. com/software/download/products-/3ff9c026.html' |
2 | A. Aho, J. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithm, Addison-Wesley Publising Companay, 1974 |
3 | D. Comer, 'The ubiquitous B-trees,' Computing Surveys 11, pp. 121-137, 1979 DOI ScienceOn |
4 | Phlip Bohannon, et al, Main-Memory Index Structures with Fixed-Size Partial Keys, ACM SIGMOD 2001 DOI |
5 | Thomas H. Cormen, et al, Introduction to Algorithms, The MIT Press, 1990 |
6 | A. J. Smith, 'Cache Memories', ACM Computing Surveys, 14:473-530, Sep., 1982 DOI ScienceOn |
7 | Peter Boncz, et al, Database Architecture Optimized for the new Bottleneck : Memory Access, VLDB 1999 |
8 | Jun Rao, et al, Making B+ Trees Cache Conscious in Main Memory, 2000 SIGMOD |
9 | Tobin J. Lehman, A Study of Index Structures for Main Memory Database Management System, VLDB 1986 |
10 | Jun Rao, et al, Cache Conscious Indexing for Decision-Support in Main Memory, VLDB 1999 |
![]() |