lpCSB+- tree : An Enhanced Main Memory Index Structure Employing the Level Prefetching Technique |
Hong Hyun Taek
(LG전자 단말기연구소)
Pee Jun Il (충북대학교 정보통신공학과) Song Seok Il (충주대학교 컴퓨터공학과) Yoo Jae Soo (충북대학교 전기전자컴퓨터공학부 및 컴퓨터ㆍ정보통신연구소) |
1 | Jun Rao and Kenneth A. Ross, 'Making B+-Trees Cache Conscious in Main Memory,' In proceedings of ACM SIGMOD Conference, pp. 475-486, 2000 DOI |
2 | Shimin Chen, Phillip B. Gibbons and Todd C. Mowry, 'Improving Index Performance through Prefetching,' In proceedings of ACM SIGMOD Conference, pp. 235-246, 2001 DOI |
3 | Intel Corporation, 'IA-32 Intel Architecture Software Developer's Manual,' Intel Corporation Order Number 245470-007, 2002 |
4 | Stefan Manegold, Peter A. Boncz and Martin L. Kersten, 'Optimizing database architecture for the new bottleneck: memory access,' In VLDB Journal 9(3), pp. 231-246, 2000 DOI |
5 | Jun Rao and Kenneth A. Ross, 'Cache Conscious Indexing for Decision-Support in Main Memory,' In proceedings of VLDB conference, pp. 78-79, 1999 |
6 | Philip Bohannon, Peter Mcllroy and Rajeev Rastogi, 'Main-Memory Index Structures with Fixed-Size Partial Keys,' In proceedings of ACM SIGMOD Conference, pp. 163-174, 2001 DOI |
7 | Anastassia Ailamaki, David J. DeWitt, Mark D Hill and David A. Wood, 'DBMSs on a Modern Processor: Where Does Time Go?,' In Proceedings of VLDB Conference, pp. 266-277, 1999 |