Implementing database operations using SIMD instructions

By Jingren Zhou, K. A. Ross. ACM SIGMOD Conference, 2002

303 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs (2009, methodology): “[39] implement va rious database operations to exploit data-level parallelism (DL P) with SIMD instructions.”
EmptyHeaded: A Relational Engine for Graph Processing (2015, background): “…data; SIMD Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.”
Decoding billions of integers per second through vectorization (2012, unknown): “Recent x86 processors have SIMD instructions that operate on vectors of four 32-bit integers (m = 4) [48, 49, 50].”
FAST: fast architecture sensitive tree search on modern CPUs and GPUs (2010, methodology): “[31] employ SIMD instructions to improve binary search performance.”
Fast and approximate stream mining of quantiles and frequencies using graphics processors (2005, background): “For example, a Pentium IV processor has a minimum penalty of 17 clock cycles per branch mis-prediction and the stall can significantly lower the performance of common database operations [47].”
Fast computation of database operations using graphics processors (2004, background): “The pixel processing engines have direct access to the texture memory and can perform vector operations with (cid:13)oating point arithmetic.”