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)
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,205 | Sample Debiasing in the Themis Open World Database System | 2020 | SIGMOD | 6.8337021e-05 |
| 6,038 | Efficient Construction of Approximate Ad-Hoc ML models Through Materialization and Reuse | 2018 | VLDB | 5.9990929e-05 |
Previous
Page 1 / 1
Next
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.00071822821 |
| 213 | Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets | 1999 | SIGMOD | 0.00024723025 |
| 393 | Bottom-Up Computation of Sparse and Iceberg CUBEs | 1999 | SIGMOD | 0.0001934104 |
| 435 | Histogram-Based Approximation of Set-Valued Query Answers | 1999 | VLDB | 0.000185063 |
| 1,053 | Multi-dimensional Selectivity Estimation Using Compressed Histogram Information | 1999 | SIGMOD | 0.00012401532 |
| 1,626 | Scalable Techniques for Mining Causal Structures | 1998 | VLDB | 0.00010190299 |
| 1,867 | Performance Measurements of Compressed Bitmap Indices | 1999 | VLDB | 9.5903618e-05 |
| 3,954 | Hierarchical Cubes for Range-Sum Queries | 1999 | VLDB | 6.9956335e-05 |
| 4,656 | Query Optimization for Selections using Bitmaps | 1999 | SIGMOD | 6.5834278e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11 | Implementing Data Cubes Efficiently | 1996 | SIGMOD |
| 2 | 11,124 | The Moments Method for Approximate Data Cube Queries | 2024 | PODS |
| 3 | 207 | On the Computation of Multidimensional Aggregates | 1996 | VLDB |
| 4 | 12,036 | An Efficient MapReduce Cube Algorithm for Varied Data Distributions | 2016 | SIGMOD |
| 5 | 6,902 | The Polynomial Complexity of Fully Materialized Coalesced Cubes | 2004 | VLDB |
| 6 | 11,609 | High-dimensional Data Cubes | 2022 | VLDB |
| 7 | 1,825 | Efficient Computation of Iceberg Cubes with Complex Measures | 2001 | SIGMOD |
| 8 | 5,955 | Mining Multi-Dimensional Constrained Gradients in Data Cubes | 2001 | VLDB |
| 9 | 393 | Bottom-Up Computation of Sparse and Iceberg CUBEs | 1999 | SIGMOD |
| 10 | 1,083 | Fast Computation of Sparse Datacubes | 1997 | VLDB |