A Main Memory-resident Multi-dimensional Index Structure Employing Partial-key and Compression Schemes |
심정민
(한국전자통신연구원 디지탈홈연구단)
민영수 (충북대학교 정보통신공학) 송석일 (충주대학교 컴퓨터공학) 유재수 (충북대학교 전기전자컴퓨터공학부) |
1 | Stefan Manegold, Peter A. Boncz and Martin L. Kersten, 'Optimizing database architecture for the new bottleneck: memory access,' VLDB Journal Vol.9, No.3, pp. 231-246, 2000 DOI |
2 | Jun Rao and Kenneth A. Ross, 'Cache Conscious Indexing for Decision-Suppoert in Main Memory,' Proceedings of VLDB, pp. 78-79, 1999 |
3 | Jun Rao and Kenneth A. Ross, 'Making B+-Trees Cache Conscious in Main Memory,' Proceedings of ACM SIGMOD, pp. 475-486, 2000 DOI |
4 | Philip Bohannon, Peter Mcilroy and Rajeev Rastogi, 'Main-Memory Index Structures with Fixed-Size Partial Keys,' Proceedings of ACM SIGMOD, pp. 163-174, 2001 DOI |
5 | Shimin Chen, Phillip B. Gibbons and Todd C. Mowry, 'Improving Index Performance through Prefetching,' Proceedings of ACM SlGMOD, pp. 235-246, 2001 DOI |
6 | Kihong Kim, Sang K. Cha and Keunjoo Kwon, 'Optimizing Multidimensional Index Trees for Main Memory Access,' Proceeding of ACM SIGMOD, pp. 139-150, 2001 DOI |
7 | I. Sitzmann and P.J. Stuckey, 'Compacting discriminator information for spatial trees,' Proceedings of the Thirteenth Australasian Database, pp. 167-176, 2002 |
8 | Guttman, A., 'Rrtrees: a Dynamic Index Structure for Spatial Searching,' Proceedings of ACM SIGMOD, pp. 47-47, 1984 DOI |
9 | Scott T. Leutenegger, J, M. Edgington, Mario A. Lopez, 'STH: A Simple and Efficient Algorithm for R-Tree Packing,' Proceedings of ICDE, pp. 497-506, 1997 DOI |
10 | Anastassia Ailamaki, David J. DeWitt, Mark D Hill and David A. Wood, 'DBMSs on a Modem Processor: Where Does Time Go?,' Proceedings of VLDB, pp. 2&3-277, 1999 |
11 | Scott T. Leutenegger, 'Multi Dimensional Data Sets,' http://www.cs.du.edu/~leut/MultiDimData.html |