Super-Scalar RAM-CPU Cache Compression

By Marcin Zukowski, Sándor Héman, Niels J. Nes, Peter A. Boncz. 2006

547 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture

How researchers see this paper

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

In Artificial Intelligence

In Computer Networks and Communications

In Hardware and Architecture

Citations in the corpus

What is the State of Neural Network Pruning? (2020, background): “There is also widespread misuse of the term “compression ratio,” which the compression literature has long used to mean original size compressed size (Siedelmann et al., 2015; Zukowski et al., 2006; Zhao et al., 2015; Lindstrom, 2014; Ratanaworabhan et al., 2006; Blalock et al., 2018), but many prun”
Integrating compression and execution in column-oriented database systems (2006, methodology): “We then evaluate a set of compression schemes and show that the best scheme depends not only on the properties of the data but also on the nature of the query workload.”
Old dogs are great at new tricks: column stores for ir prototyping (2014, unknown): “Publication rights licensed to ACM.”
Relational query coprocessing on graphics processors (2009, methodology): “As future work, we plan to investigate compression techniques [Zukowski et al. 2006; Abadi et al. 2006] in GDB to reduce the overhead of data transfer between the main memory and the GPU memory.”
Relational joins on graphics processors (2008, methodology): “Existing techniques [40] for rewriting the branches on the CPU can also be applied to the GPU.”
Decoding billions of integers per second through vectorization (2012, methodology): “compulsory bit width exceptions compressed exceptions PFOR [23] yes per page per page no PFOR2008 [26] yes per page per page 8, 16, 32 bits NewPFD/OptPFD [10] no per block per block Simple-16 FastPFOR (§ 5) no per block per page binary packing SIMD-FastPFOR (§ 5) no per block per page vectorized bin”
FAST: fast architecture sensitive tree search on modern CPUs and GPUs (2010, background): “This increased memory bandwidth can improve query processing speed as long as decompression overhead is kept minimal [19, 33].”
A General SIMD-Based Approach to Accelerating Compression Algorithms (2015, methodology): “To deal with exceptional values, Zukowski et al. [Zukowski 2006] proposed PFORDelta (PFD), which separates normal integers from exceptional integers.”
Introduction to Information Retrieval (2008, unknown): “The TREC evaluations are described in detail by Voorhees and Harman (2005). Online information is available at http://trec.”
Database Cracking (2007, methodology): “To handle the extra storage space required, compression is used, which is also shown to speedup query execution in column oriented databases [1, 16].”