The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Super-Scalar RAM-CPU Cache Compression
Abstract
High-performance data-intensive query processing tasks like OLAP, data mining or scientific data analysis can be severely I/O bound, even when high-end RAID storage systems are used. Compression can alleviate this bottleneck only if encoding and decoding speeds significantly exceed RAID I/O bandwidth. For this purpose, we propose three new versatile compression schemes (PDICT, PFOR, and PFOR-DELTA) that are specifically designed to extract maximum IPC from modern CPUs. We compare these algorithms with compression techniques used in (commercial) database and information retrieval systems. Our experiments on the MonetDB/X100 database system, using both DSM and PAX disk storage, show that these techniques strongly accelerate TPC-H performance to the point that the I/O bottleneck is eliminated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Witten, I. H., Moffat, A., & Bell, T. (1999) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 705
MonetDB/X100: Hyper-Pipelining Query Execution
Boncz, P. A., Żukowski, M., & Nes, N. J. (2005) · Data Archiving and Networked Services (DANS) · Cited by 484
Self-citationCompressing relations and indexes
Goldstein, J., Ramakrishnan, R., & Shaft, U. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655800 · Cited by 203
Cited by
Column-stores vs. row-stores: how different are they really?
Abadi, D. J., Madden, S. R., & Hachem, N. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376712 · Cited by 436
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Kim, C., Chhugani, J., Satish, N., Sedlar, E., Nguyen, A. D., Kaldewey, T., Lee, V. W., Brandt, S. A., & Dubey, P. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807206 · Cited by 306
Inverted index compression and query processing with optimized document ordering
Yan, H., Ding, S., & Suel, T. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526764 · Cited by 275
Using graphics processors for high performance IR query processing
Ding, S., He, J., Yan, H., & Suel, T. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526766 · Cited by 56
Metadata
- Authors
- Zukowski, M., Heman, S., Nes, N., & Boncz, P.
- Venue
- 22nd International Conference on Data Engineering (ICDE'06)
- Publisher
- IEEE
- Published
- 2006
- Pages
- 59-59
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2140453381
- Cited by
- 476
- References
- 5
- FWCI
- 11.66
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Super-Scalar RAM-CPU Cache Compression. https://app.cochat.ai/papers/10.1109/icde.2006.150
- The paper
- Zukowski, M., Heman, S., Nes, N., & Boncz, P. (2006). Super-Scalar RAM-CPU Cache Compression. 22nd International Conference on Data Engineering (ICDE'06). https://doi.org/10.1109/icde.2006.150
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.