Effect of node size on the performance of cache-conscious B +-trees

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 283-295

  Hankins, Richard A ^a   Patel, Jignesh M ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

B+ tree; Cache Conscious; Index

Indexed keywords

BUFFER STORAGE; DATABASE SYSTEMS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROGRAM PROCESSORS;

B+-TREE; CACHE-CONSCIOUS; INDEX;

TREES (MATHEMATICS);

EID: 33646202971     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/885651.781063     Document Type: Conference Paper

References (32)

1. ADVE, S. V., ADVE, V. S., HILL, M. D., AND VERNON, M. K. Comparison of Hardware and Software Cache Coherence Schemes. ACM SIGARCH Computer Architecture News 19, 3 (1991), 298-308.
2. AILAMAKI, A., DEWITT, D. J., HILL, M. D., AND WOOD, D. A. DBMSs on a Modern Processor: Where Does Time Go? In Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, UK (September 1999), pp. 266-277.
3. BERNSTEIN, P. A., BRODIE, M. L., CERI, S., DEWITT, D. J., FRANKLIN, M. J., GARCIA-MOLINA, H., GRAY, J., HELD, G., HELLERSTEIN, J. M., JAGADISH, H. V., LESK, M., MAIER, D., NAUGHTON, J. F., PIRAHESH, H., STONEBRAKER, M., AND ULLMAN, J. D. The Asilomar Report on Database Research. SIGMOD Record 27, 4 (1998), 74-80.
4. BITTON, D., DEWITT, D. J., AND TURBYFILL, C. Benchmarking database systems a systematic approach. In Proceedings of the 9th International Conference on Very Large Data Bases, Florence, Italy. (1983), pp. 8-19.
5. BOHANNON, P., MCILROY, P., AND RASTOGI, R. Main-Memory Index Structures with Fixed-Size Partial Keys. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, USA (May 2001), pp. 163-174.
6. BONCZ, P. A., MANEGOLD, S., AND KERSTEN, M. L. Database Architecture Optimized for the New Bottleneck: Memory Access. In Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, UK (September 1999), pp. 54-65.
7. BROWNE, S., DONGARRA, J., GARNER, N., HO, G., AND MUCCI, P. A Portable Programming Interface for Performance Evaluation on Modern Processors. The International Journal of High Performance Computing Applications 14, 3 (2000), 189-204.
8. CARDENAS, A. Analysis and Performance of Inverted Data Base Structures. Communications of the ACM 18, 5 (May 1975), 253-264.
9. CHA, S. K., HWANG, S., KIM, K., AND KWON, K. Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems. In Proceedings of 27th International Conference on Very Large Data Bases, Roma, Italy (2001).
10. CHEN, S., GIBBONS, P. B., AND MOWRY, T. C. Improving Index Performance through Prefetching. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, USA (May 2001), pp. 235-246.
11. CHEN, S., GIBBONS, P. B., MOWRY, T. C., AND VALENTIN, G. Fractal Prefetching B+trees: Optimizing Both Cache and Disk Performance. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, WI, USA (May 2002), pp. 157-168.
12. CHILIMBI, T., HILL, M. D., AND LARUS, J. R. Cache-Conscious Structure Layout. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, Atlanta, Georgia, USA (May 1999), pp. 1-12.
13. CHOU, H.-T., AND DEWITT, D. J. An Evaluation of Buffer Management Strategies for Relational Database Systems. In Proceedings of the 11th International Conference on Very Large Data Bases, Stockholm, Sweden (Aug. 1985), Morgan Kaufmann, pp. 127-141.
14. DEWITT, D. J. The Wisconsin Benchmark: Past, Present, and Future. In The Benchmark Handbook for Database and Transaction Systems (1993), J. Gray, Ed., Morgan Kaufmann.
15. DOALLO, R., FRAGUELA, B., AND ZAPATA, E. Direct Mapped Cache Performance Modeling for Sparse Matrix Operations. In 7th EUROMICRO Workshop on Parallel and Distributed Processing (February 1999), pp. 331-338.
16. GHOSH, S., MARTONOSI, M., AND MALIK, S. Cache Miss Equations: An Analytical Representation of Cache Misses. In Proceedings of the 11th International Conference on Supercomputing (1997), ACM Press, pp. 317-324.
17. GRAEFE, G., BUNKER, R., AND COOPER, S. Hash Joins and Hash Teams in Microsoft SQL Server. In Proceedings of the 24th International Conference on Very Large Data Bases, New York City, New York, USA (August 1998), pp. 86-97.
18. GRAY, J., AND GRAEFE, G. The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb. SIGMOD Record 26, 4 (1997).
19. HANKINS, R. A., AND PATEL, J. M. Effect of Node Size on the Performance of Cache-Conscious Indices. Extended Report, http://www.eecs.umich.edu/ quickstep/publ/ccindices.pdf (2003).
20. HENNESSY, J., AND PATTERSON, D. Computer Architecture: A Quantitative Approach. Morgan Kauffman, 1998.
21. KIM, K., CHA, S. K., AND KWON, K. Optimizing Multidimensional Index Trees for Main Memory Access. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, Santa Barbara, CA, USA (May 2001), pp. 139-150.
22. LEHMAN, T. J., AND CAREY, M. J. A Study of Index Structures for Main Memory Database Management Systems. In Proceedings of the 12th International Conference on Very Large Data Bases, Kyoto, Japan (August 1986), pp. 294-303.
23. LO, J. L., BARROSO, L. A., EGGERS, S. J., GHARACHORLOO, K., LEVY, H. M., AND PAREKH, S. S. An Analysis of Database Workload Performance on Simultaneous Multithreaded Processors. In Proceedings of the 25th Annual International Symposium on Computer Architecture, Barcelona, Spain (1998), pp. 39-50.
24. LOMET, D. B-tree Page Size When Caching is Considered. SIGMOD Record 27, 3 (1998).
25. NYBERG, C., BARCLAY, T., CVETANOVIC, Z., GRAY, J., AND LOMET, D. B. AlphaSort: A Cache-Sensitive Parallel External Sort. VLDB Journal 4, 4 (1995), 603-627.
26. RAO, J., AND ROSS, K. A. Cache Conscious Indexing for Decision-Support in Main Memory. In Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, UK (September 1999), pp. 78-89.
27. +-Trees Cache Conscious in Main Memory. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, USA (May 2000), pp. 475-486.
28. SHATDAL, A., KANT, C., AND NAUGHTON, J. F. Cache Conscious Algorithms for Relational Query Processing. In Proceedings of the 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile (September 1994), pp. 510-521.
29. VERNON, M., AND HOLLIDAY, M. A. Performance Analysis of Multiprocessor Cache Consistency Protocols Using Generalized Timed Petri Nets. Performance Eval. Rev. (USA), Spec. Issue 14, 1 (May 1986), 9-17.
30. VERNON, M. K., JOG, R., AND SOHI, G. S. Performance Analysis of Hierarchical Cache-Consistent Multiprocessors. Performance Evaluation 9, 4 (1989), 287-302.
31. YAO, A. On Random 2-3 Trees. Acta Informatica 9 (1978), 159-170.
32. YAO, S. Approximating Block Accesses in Database Organization. Communications of the ACM 20, 4 (Apr. 1977), 260-261.