Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 244

The DOI matches its Crossref record.

Bottom-up computation of sparse and Iceberg CUBE

Beyer, Kevin, Ramakrishnan, Raghu · 1999 · Proceedings of the 1999 ACM SIGMOD international conference on Management of data

Abstract

We introduce the Iceberg-CUBE problem as a reformulation of the datacube (CUBE) problem. The Iceberg-CUBE problem is to compute only those group-by partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of Iceberg-CUBE can be used (1) to answer group-by queries with a clause such as HAVING COUNT(*) >= X, where X is greater than the threshold, (2) for mining multidimensional association rules, and (3) to complement existing strategies for identifying interesting subsets of the CUBE for precomputation.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/304182.304214

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 244

Metadata

Authors
Beyer, K., & Ramakrishnan, R.
Venue
Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Publisher
ACM
Published
1999-06
Pages
359-370
ISSN
0730-8078 (ISSN-L)
OpenAlex
W4230230708
Cited by
244
References
0
FWCI
6.24
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: Bottom-up computation of sparse and Iceberg CUBE. https://app.cochat.ai/papers/10.1145/304182.304214
The paper
Beyer, K., & Ramakrishnan, R. (1999). Bottom-up computation of sparse and Iceberg CUBE. Proceedings of the 1999 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/304182.304214

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.