NetCube: A Scalable Tool for Fast Data Mining and Compression

Summary: NetCube represents DataCubes with Bayesian networks, exploiting attribute correlations to compress multidimensional counts while supporting arbitrary aggregate queries in time independent of database size. Linear-time, parallelizable construction delivers high compression (≥1800:1) and low error (<5%). (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: ha7ef741c713f709c
Venue: VLDB
Year: 2001
Pagerank: 5.3587028e-05
Overall Rank: 8,301 | 44.21%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Dimitris Margaritis (Carnegie Mellon University)
2. Christos Faloutsos (Carnegie Mellon University)
3. Sebastian Thrun (Carnegie Mellon University)

BibTeX Citation

@article{margaritis_vldb01,
        title = {{NetCube: A Scalable Tool for Fast Data Mining and Compression}},
        author = {Margaritis, Dimitris and Faloutsos, Christos and Thrun, Sebastian},
        journal = {PVLDB},
        series = {{VLDB} '01},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,254	Sample Debiasing in the Themis Open World Database System	2020	SIGMOD	6.698367e-05
6,146	Efficient Construction of Approximate Ad-Hoc ML models Through Materialization and Reuse	2018	VLDB	5.869373e-05

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
11	Implementing Data Cubes Efficiently	1996	SIGMOD	0.00071056708
222	Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets	1999	SIGMOD	0.00024210103
403	Bottom-Up Computation of Sparse and Iceberg CUBEs	1999	SIGMOD	0.00019094951
448	Histogram-Based Approximation of Set-Valued Query Answers	1999	VLDB	0.00018121533
1,078	Multi-dimensional Selectivity Estimation Using Compressed Histogram Information	1999	SIGMOD	0.00012149796
1,654	Scalable Techniques for Mining Causal Structures	1998	VLDB	9.9694714e-05
1,896	Performance Measurements of Compressed Bitmap Indices	1999	VLDB	9.4103502e-05
4,033	Hierarchical Cubes for Range-Sum Queries	1999	VLDB	6.836854e-05
4,751	Query Optimization for Selections using Bitmaps	1999	SIGMOD	6.4341944e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11	Implementing Data Cubes Efficiently	1996	SIGMOD
2	11,478	The Moments Method for Approximate Data Cube Queries	2024	PODS
3	214	On the Computation of Multidimensional Aggregates	1996	VLDB
4	12,337	An Efficient MapReduce Cube Algorithm for Varied Data Distributions	2016	SIGMOD
5	7,046	The Polynomial Complexity of Fully Materialized Coalesced Cubes	2004	VLDB
6	11,923	High-dimensional Data Cubes	2022	VLDB
7	1,875	Efficient Computation of Iceberg Cubes with Complex Measures	2001	SIGMOD
8	6,078	Mining Multi-Dimensional Constrained Gradients in Data Cubes	2001	VLDB
9	403	Bottom-Up Computation of Sparse and Iceberg CUBEs	1999	SIGMOD
10	1,069	Fast Computation of Sparse Datacubes	1997	VLDB