Optimizing multidimensional index trees for main memory access

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 30, Issue 2, 2001, Pages 139-150

  Kim, Kihong ^a   Cha, Sang K ^a   Kwon, Keunjoo ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040748320     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/376284.375679     Document Type: Article

References (20)

1. P. Boncz, S. Manegold, and M. Kersten, "Database Architecture Optimized for the New Bottleneck: Memory Access", Proceedings of VLDB Conference, 1999, pp. 54-65.
2. A. Ailamaki, D. J. DeWitt, M. D. Hill, D. A. Wood, "DBMSs on a Modern Processor: Where Does Time Go?", Proceedings of VLDB Conference, 1999, pp. 266-277.
3. J. L. Hennessy and D. A. Patterson, Computer Architecture: A Quantitative Approach, 2nd Edition, Morgan Kaufmann, 1996.
4. J. Rao, K. A. Ross, "Cache Conscious Indexing for Decision-Support in Main Memory", Proceedings of VLDB Conference, 1999, pp. 78-89.
5. J. Rao, K. A. Ross, "Making B+-trees Cache Conscious in Main Memory", Proceedings of ACM SIGMOD Conference, 2000, pp. 475-486.
6. A. Guttman, "R-trees: A Dynamic Index Structure for Spatial Searching", Proceedings of ACM SIGMOD Conference, 1984, pp. 47-57.
7. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles", Proceedings of ACM SIGMOD Conference, 1990, pp. 322-331.
8. C. Faloutsos and I. Kamel, "Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension", Proceedings of ACM PODS Symposium, 1994, pp. 4-13.
9. T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, "Multi-Step Processing of Spatial Joins", Proceedings of ACM SIGMOD Conference, 1994, pp. 197-208.
10. TM User's Manual, 1997.
11. J. M. Hellerstein, "Indexing Research: Forest or Trees?", Proceedings of ACM SIGMOD Conference, 2000, pp. 574, Panel.
12. T. Sellis, N. Roussopoulos, and C. Faloutsos, "The R+-tree: A Dynamic Index for Multi-dimensional Objects", Proceedings of VLDB Conference, 1987, pp. 507-518.
13. I. Kamel and C. Faloutsos, "Hilbert R-tree: An Improved R-tree Using Fractals", Proceedings of VLDB Conference, 1994, pp. 500-509.
14. V. Gaede and O. Günther, "Multidimensional Access Methods", Computing Surveys, 30(2), 1998, pp. 170-231.
15. A. Bookstein, S. T. Klein, T. Raita, "Is Huffman Coding Dead?", Proceedings of ACM SIGIR Conference, 1993, pp. 80-87.
16. J. Goldstein, R. Ramakrishnan, and U. Shaft, "Compressing Relations and Indexes", Proceedings of IEEE Conference on Data Engineering, 1998, pp. 370-379.
17. I. Kamel and C. Faloutsos, "On Packing R-trees", Proceedings of ACM CIKM Conference, 1993, pp. 490-499.
18. S. T. Leutenegger, J. M. Edgington, M. A. Lopez, "STR: A Simple and Efficient Algorithm for R-Tree Packing", Proceedings of IEEE Conference on Data Engineering, 1997, pp. 497-506.
19. S. Berchtold, C. Böhm, H.-P. Kriegel, "The Pyramid-Tree: Breaking the Curse of Dimensionality", Proceedings of ACM SIGMOD Conference, 1998, pp. 142-153.
20. R. Enbody, Perfmon Performance Monitoring Tool, 1999, available from http://www.cps.msu.edu/~enbody/perfmon.ht ml.