Designing fast architecture-sensitive tree search on modern multicore/many-core processors

ACM Transactions on Database Systems

Volumn 36, Issue 4, 2011, Pages

  Kim, Changkyu ^a   Chhugani, Jatin ^a   Satish, Nadathur ^a   Sedlar, Eric ^b   Nguyen, Anthony D ^a   Kaldewey, Tim ^b   Lee, Victor W ^a   Brandt, Scott A ^c   Dubey, Pradeep ^a  

^a INTEL CORPORATION   (United States)

^b ORACLE CORPORATION   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compression; CPU; GPU; Many core; Multicore; Single instruction multiple data (SIMD); Tree search

Indexed keywords

CPU; GPU; MANY-CORE; MULTI CORE; SINGLE INSTRUCTION MULTIPLE DATA; TREE SEARCH;

BANDWIDTH COMPRESSION; BINARY TREES; CACHE MEMORY; COMPACTION; FIRE FIGHTING EQUIPMENT; FORESTRY; MEMORY ARCHITECTURE; PROGRAM PROCESSORS;

TREES (MATHEMATICS);

COMPACTION; COMPRESSION; DATA; EQUIPMENT; FIRE FIGHTING; FORESTRY; MATHEMATICS; TREES;

EID: 84855233939     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2043652.2043655     Document Type: Conference Paper

References (43)

1. ABADI, D., MADDEN, S., AND FERREIRA, M. 2006. Integrating compression and execution in column-oriented database systems. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 671-682. (Pubitemid 46946548)
2. ALCANTARA, D. A., SHARF, A., ABBASINEJAD, F., SENGUPTA, S., ET AL. 2009. Real-Time parallel hashing on the GPU. ACM Trans. Graph. 28, 5.
3. ALLAN, V. H., JONES, R. B., LEE, R. M., AND ALLAN, S. J. 1995. Software pipelining. ACM Comput. Surv. 27, 3, 367-432.
4. ARGE, L. 2003. The buffer tree: A technique for designing batched external data structures. Algorithmica 37, 1, 1-24.
5. BAYER, R. AND UNTERAUER, K. 1977. Prefix b-trees. ACM Trans. Datab. Syst. 2, 1, 11-26.
6. BELAZZOUGUI, D., BOLDI, P., PAGH, R., AND VIGNA, S. 2009. Theory and practice of monotone minimal perfect hashing. In Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX). 132-144.
7. BINNIG, C., HILDENBRAND, S., AND FÄRBER, F. 2009. Dictionary-Based order-preserving string compression for column stores. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 283-296.
8. BOHANNON, P.,MCLLROY, P., AND RASTOGI, R. 2001. Main-Memory index structures with fixed-size partial keys. .In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 163-174.
9. BONCZ, P. A.,ZUKOWSKI,M., ANDNES,N. 2005. Monetdb/x100: Hyper-pipelining query execution. In Proceedings of the Conference on Innovative Data Systems Research (CIDR).
10. CHEN, S.,GIBBONS, P. B., AND MOWRY, T. C. 2001. Improving index performance through prefetching. SIGMOD Rec. 30, 2, 235-246.
11. CHEN, S., GIBBONS, P. B., MOWRY, T. C., ET AL. 2002. Fractal prefetching b+-trees: Optimizing both cache and disk performance. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 157-168. (Pubitemid 34985544)
12. CHHUGANI, J., NGUYEN, A. D., LEE, V. W.,MACY, W., HAGOG, M., CHEN, Y.-K., BARANSI, A., KUMAR, S., AND DUBEY, P. 2008. Efficient implementation of sorting on multi-core SIMD CPU architecture. In Proceedings of the International Conference on Very Large Data Bases (VLDB) 1, 2.
13. CIESLEWICZ, J.,MEE, W., AND ROSS, K. A. 2009. Cache-Conscious buffering for database operators with state. .In Proceedings of the 5th International Workshop on Data Management on New Hardware.
14. CIESLEWICZ, J. AND ROSS, K. A. 2007. Adaptive aggregation on chip multiprocessors. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 339-350.
15. COMER, D. 1979. Ubiquitous b-tree. ACM Comput. Surv. 11, 2, 121-137.
16. FOX, E. A.,CHEN, Q. F.,DAOUD, A. M., AND HEATH, L. S. 1991. Order-Preserving minimal perfect hash functions. .ACM Trans. Inf. Syst. 9, 3, 281-308.
17. GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1998. Compressing relations and indexes. In Proceedings of the International Conference on Data Engineering (ICDE). 370-379.
18. GRAEFE, G. AND LARSON, P.-A. 2001. B-tree indexes and cpu caches. In Proceedings of the International Conference on Data Engineering (ICDE). 349-358. (Pubitemid 32462649)
19. GRAEFE, G., LINVILLE, A., AND SHAPIRO, L. D. 1994. Sort versus hash revisited. IEEE Trans. Knowl. Data Engin. 6, 6, 934-944.
20. GRAEFE, G. AND SHAPIRO, L. 1991. Data compression and database performance. In Applied Computing, 22-27.
21. HANKINS, R. A. AND PATEL, J. M. 2003. Effect of node size on the performance of cache-conscious b+-trees. In Proceedings of the International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS). 283-294.
22. HARIZOPOULOS, S. AND AILAMAKI, A. 2003. A case for staged database systems. In Proceedings of the Conference on Innovative Data Systems Research (CIDR).
23. HARIZOPOULOS, S. AND AILAMAKI, A. 2006. Improving instruction cache performance in oltp. ACM Trans. .Database Syst. 31, 3, 887-920. (Pubitemid 44600829)
24. HOLLOWAY, A. L., RAMAN, V., SWART, G., AND DEWITT, D. J. 2007. How to barter bits for chronons: Tradeoffs for database scans. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 389-400. (Pubitemid 47630823)
25. IYER, B. R. AND WILHITE, D. 1994. Data compression support in databases. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 695-704.
26. KALDEWEY, T., HAGEN, J., BLAS, A. D., AND SEDLAR, E. 2009. Parallel search on video cards. In Proceedings of the USENIX Workshop on Hot Topics in Parallelism.
27. KIM, C., CHHUGANI, J., SATISH, N., SEDLAR, E., NGUYEN, A. D., KALDEWEY, T., LEE, V. W., BRANDT, S. A., AND DUBEY, P. 2010. FAST: Fast architecture sensitive tree search on modern CPUs and GPUs. .In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 339-350.
28. KIM, C., SEDLAR, E., CHHUGANI, J., KALDEWEY, T., NGUYEN, A. D., BLAS, A. D., LEE, V. W., SATISH, N., AND DUBEY, P. 2009. Sort vs. hash revisited: Fast join implementation on multi-core CPUs. In Proceedings of the International Conference on Very Large Data Bases (VLDB) 2, 2, 1378-1389.
29. LEHMAN, T. J. AND CAREY, M. J. 1986. A study of index structures for main memory database management systems. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 294-303.
30. LEISCHNER, N., OSIPOV, V., AND SANDERS, P. 2009. Fermi Architecture White paper.
31. LU, H. AND TAN, K.-L. 1995. On sort-merge algorithm for band joins. IEEE Trans. Knowl. Data Engin. 7, 3, 508-510.
32. NVIDIA. 2010. NVIDIACUDAProgramming Guide 3.2. http://developer.download. nvidia.com/compute/cuda/ 3 2/toolkit/docs/CUDA C Programming-Guide.pdf.
33. RAO, J. AND ROSS, K. A. 1999. Cache conscious indexing for decision support in main memory. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 78-89.
34. RAO, J. AND ROSS, K. A. 2000. Making b+- trees cache conscious in main memory. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 475-486.
35. REILLY, M. 2008. When multicore isn't enough: Trends and the future for multi-multicore systems. In Proceedings of the Annual High-Performance Embedded Computing Workshop (HPEC).
36. SATISH, N., HARRIS, M., AND GARLAND, M. 2009. Designing efficient sorting algorithms for manycore GPUs. In International Symposium on Parallel and Distributed Processing. 1-10.
37. SCHLEGEL, B., GEMULLA, R., AND LEHNER, W. 2009. k-ary search on modern processors. In Proceedings of the Workshop on Data Management on New Hardware (DaMoN). 52-60.
38. SEILER, L., CARMEAN, D., SPRANGLE, E., FORSYTH, T., ABRASH, M., DUBEY, P., JUNKINS, S., LAKE, A., SUGERMAN, J., CAVIN, R., ESPASA, R., GROCHOWSKI, E., JUAN, T., AND HANRAHAN, P. 2008. Larrabee: A many-core x86 architecture for visual computing. Trans. Graph. 27, 3.
39. SKAUGEN, K. B. 2010. Keynote at international supercomputing conference. In Proceedings of the Annual High-Performance Embedded Computing Workshop (HPEC)
40. WILLHALM, T., POPOVICI, N., BOSHMAF, Y., PLATTNER, H., ET AL. 2009. Simd-scan: Ultra fast in-memory scan using vector processing units. In Proceedings of the International Conference on Very Large Data Bases (VLDB) 2, 1, 385-394.
41. ZHOU, J. AND ROSS, K. A. 2002. Implementing database operations using simd instructions. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). 145-156. (Pubitemid 34985543)
42. ZHOU, J. AND ROSS, K. A. 2003. Buffering accesses to memory resident index structures. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 405-416.
43. ZUKOWSKI, M., HÉMAN, S., NES, N., AND BONCZ, P. A. 2006. Super-Scalar RAM-CPU cache compression. In Proceedings of the International Conference on Data Engineering (ICDE). 59.