Algorithms in C
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Fast Computation of Sparse Datacubes
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Compressed data cubes for OLAP aggregate query approximation on continuous dimensions
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
A dynamic load balancing strategy for parallel datacube computation
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
On the content of materialized aggregate views
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient computation of Iceberg cubes with complex measures
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Iceberg-cube computation with PC clusters
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Mining frequent patterns by pattern-growth: methodology and implications
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Multi-dimensional sequential pattern mining
Proceedings of the tenth international conference on Information and knowledge management
Scalable frequent-pattern mining methods: an overview
Tutorial notes of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Constrained frequent pattern mining: a pattern-growth view
ACM SIGKDD Explorations Newsletter
Distributed and Parallel Databases - Special issue: Parallel and distributed data mining
Cubegrades: Generalizing Association Rules
Data Mining and Knowledge Discovery
Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Mining Multi-Dimensional Constrained Gradients in Data Cubes
Proceedings of the 27th International Conference on Very Large Data Bases
Partitioning Algorithms for the Computation of Average Iceberg Queries
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Elimination of Redundant Views in Multidimensional Aggregates
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Computing Full and Iceberg Datacubes Using Partitions
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Computing Partial Data Cubes for Parallel Data Warehousing Applications
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Flexible Data Cubes for Online Aggregation
ICDT '01 Proceedings of the 8th International Conference on Database Theory
NetCube: A Scalable Tool for Fast Data Mining and Compression
Proceedings of the 27th International Conference on Very Large Data Bases
A simple algorithm for finding frequent elements in streams and bags
ACM Transactions on Database Systems (TODS)
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Handbook of massive data sets
Aggregate view management in data warehouses
Handbook of massive data sets
Efficiently computing the top N averages in iceberg cubes
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Optimizing Selections over Datacubes
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
On the content of materialized aggregate views
Journal of Computer and System Sciences - Special issue on PODS 2000
QC-trees: an efficient summary structure for semantic OLAP
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Dynamic multidimensional data cubes
Multidimensional databases
CubiST++: Evaluating Ad-Hoc CUBE Queries Using Statistics Trees
Distributed and Parallel Databases
Hierarchical dwarfs for the rollup cube
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Mining unexpected rules by pushing user dynamics
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Carpenter: finding closed patterns in long biological datasets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors
Distributed and Parallel Databases
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
FARMER: finding interesting rule groups in microarray datasets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mining Constrained Gradients in Large Databases
IEEE Transactions on Knowledge and Data Engineering
Incremental maintenance of quotient cube for median
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
From sequential pattern mining to structured pattern mining: a pattern-growth approach
Journal of Computer Science and Technology
Incremental maintenance of quotient cube based on Galois lattice
Journal of Computer Science and Technology
PrefixCube: prefix-sharing condensed data cube
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
Divide-and-Approximate: A Novel Constraint Push Strategy for Iceberg Cube Mining
IEEE Transactions on Knowledge and Data Engineering
PnP: Parallel and External Memory Iceberg Cube Computation
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Extending XQuery for analytics
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Mining condensed frequent-pattern bases
Knowledge and Information Systems
Parallel querying of ROLAP cubes in the presence of hierarchies
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Communication and Memory Optimal Parallel Data Cube Construction
IEEE Transactions on Parallel and Distributed Systems
Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams
Distributed and Parallel Databases
The cgmCUBE project: Optimizing parallel data cube generation for ROLAP
Distributed and Parallel Databases
Supporting ad-hoc ranking aggregates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Semi-closed cube: an effective approach to trading off data cube size and query response time
Journal of Computer Science and Technology
CURE for cubes: cubing using a ROLAP engine
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Bellwether analysis: predicting global aggregates from local regions
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient incremental maintenance of data cubes
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Flowcube: constructing RFID flowcubes for multi-dimensional analysis of commodity flows
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Data mining with the SAP NetWeaver BI accelerator
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Regression Cubes with Lossless Compression and Aggregation
IEEE Transactions on Knowledge and Data Engineering
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach
IEEE Transactions on Knowledge and Data Engineering
Progressive and selective merge: computing top-k with ad-hoc ranking functions
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Progressive ranking of range aggregates
Data & Knowledge Engineering
Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions
IEEE Transactions on Knowledge and Data Engineering
Answering ad hoc aggregate queries from data streams using prefix aggregate trees
Knowledge and Information Systems
Multi-dimensional regression analysis of time-series data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Approximate frequency counts over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The generalized MDL approach for summarization
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
ROLAP implementations of the data cube
ACM Computing Surveys (CSUR)
Iceberg-cube algorithms: An empirical evaluation on synthetic and real data
Intelligent Data Analysis
COMBI-operator - database support for data mining applications
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Finding hierarchical heavy hitters in data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Star-cubing: computing iceberg cubes by top-down and bottom-up integration
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
High-dimensional OLAP: a minimal cubing approach
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The polynomial complexity of fully materialized coalesced cubes
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient computation of view subsets
Proceedings of the ACM tenth international workshop on Data warehousing and OLAP
Mapgraph: efficient methods for complex olap hierarchies
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Finding hierarchical heavy hitters in streaming data
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining approximate top-k subspace anomalies in multi-dimensional time-series data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
PnP: sequential, external memory, and parallel iceberg cube computation
Distributed and Parallel Databases
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Context-aware content filtering & presentation for pervasive & mobile information systems
Proceedings of the 1st international conference on Ambient media and systems
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Sampling cube: a framework for statistical olap over sampling data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Supporting the data cube lifecycle: the power of ROLAP
The VLDB Journal — The International Journal on Very Large Data Bases
Extracting k most important groups from data efficiently
Data & Knowledge Engineering
The design and implementation of an OLAP system for sequence data analysis
Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research
Visual Exploration of Frequent Itemsets and Association Rules
Visual Data Mining
A Summary Structure of Data Cube Preserving Semantics
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
A Temporal Dominant Relationship Analysis Method
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
A Probabilistic Approach for Computing Approximate Iceberg Cubes
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Dwarfs in the rearview mirror: how big are they really?
Proceedings of the VLDB Endowment
FCLOS: A client-server architecture for mobile OLAP
Data & Knowledge Engineering
Multi-Dimensional Relational Sequence Mining
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
Bellwether analysis: Searching for cost-effective query-defined predictors in large databases
ACM Transactions on Knowledge Discovery from Data (TKDD)
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
On-line evaluation of a data cube over a data stream
ACS'08 Proceedings of the 8th conference on Applied computer scince
Answering aggregate keyword queries on relational databases using minimal group-bys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Mining non-derivable frequent itemsets over data stream
Data & Knowledge Engineering
Computing data cubes using exact sub-graph matching: the sequential MCG approach
Proceedings of the 2009 ACM symposium on Applied Computing
Space-optimal heavy hitters with strong error bounds
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Multi-Tree Cubing algorithm for computing iceberg cubes
Journal of Intelligent Information Systems
Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
BitCube: A Bottom-Up Cubing Engineering
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Exact and Approximate Sizes of Convex Datacubes
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
High Performance Analytics with the R3-Cache
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Compressing multidimensional structures: a case study
ECC'09 Proceedings of the 3rd international conference on European computing conference
Parallel OLAP with the Sidera server
Future Generation Computer Systems
Mining multidimensional and multilevel sequential patterns
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining significant change patterns in multidimensional spaces
International Journal of Business Intelligence and Data Mining
Mining convergent and divergent sequences in multidimensional data
International Journal of Business Intelligence and Data Mining
Reduced representations of Emerging Cubes for OLAP database mining
International Journal of Business Intelligence and Data Mining
Strategies for complex data cube queries
Applied Intelligence
Graph OLAP: a multi-dimensional framework for graph data analysis
Knowledge and Information Systems
Promotion analysis in multi-dimensional space
Proceedings of the VLDB Endowment
An efficient method for maintaining data cubes incrementally
Information Sciences: an International Journal
Association rule mining in multiple, multidimensional time series medical data
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Efficiently computing iceberg cubes with complex constraints through bounding
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
PHC: a rapid parallel hierarchical cubing algorithm on high dimensional OLAP
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Revisiting the cube lifecycle in the presence of hierarchies
The VLDB Journal — The International Journal on Very Large Data Bases
Finding frequent elements in non-bursty streams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
Sidera: a cluster-based server for online analytical processing
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Fast Manhattan sketches in data streams
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space-optimal heavy hitters with strong error bounds
ACM Transactions on Database Systems (TODS)
Double table switch: an efficient partitioning algorithm for bottom-up computation of data cubes
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II
Extracting semantics in OLAP databases using emerging cubes
Information Sciences: an International Journal
Multidimensional cyclic graph approach: Representing a data cube without common sub-graphs
Information Sciences: an International Journal
Latent OLAP: data cubes over latent variables
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient topological OLAP on information networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Parallel data cubes on multi-core processors with multiple disks
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
Task scheduling for GPU accelerated OLAP systems
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
A parallel and distributed method for computing high dimensional MOLAP
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
M2SP: mining sequential patterns among several dimensions
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
The computation of semantic data cube
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Multiway iceberg cubing on trees
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Computing iceberg quotient cubes with bounding
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
On the computation of maximal-correlated cuboids cells
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Efficient computation of multi-feature data cubes
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Warehousing and mining massive RFID data sets
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
PMC: select materialized cells in data cubes
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
HQC: an efficient method for ROLAP with hierarchical dimensions
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Computing high dimensional MOLAP with parallel shell mini-cubes
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Building the data warehouse of frequent itemsets in the DWFIST approach
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Evaluation of top-k OLAP queries using aggregate r–trees
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Multiway pruning for efficient iceberg cubing
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Lossless reduction of datacubes
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Flexible online association rule mining based on multidimensional pattern relations
Information Sciences: an International Journal
Dynamic construction of user defined virtual cubes
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Exploiting virtual patterns for automatically pruning the search space
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
A false negative maximal frequent itemset mining algorithm over stream
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-Dimensional Relational Sequence Mining
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
HMGraph OLAP: a novel framework for multi-dimensional heterogeneous network analysis
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
A clustered Dwarf structure to speed up queries on data cubes
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Expectation propagation in genspace graphs for summarization
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Convex cube: towards a unified structure for multidimensional databases
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Efficient distributed parallel top-down computation of ROLAP data cube using mapreduce
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
Multi-level relationship outlier detection
International Journal of Business Intelligence and Data Mining
Efficient and Effective Aggregate Keyword Search on Relational Databases
International Journal of Data Warehousing and Mining
Memory-efficient groupby-aggregate using compressed buffer trees
Proceedings of the 4th annual Symposium on Cloud Computing
Efficient frequent itemset mining methods over time-sensitive streams
Knowledge-Based Systems
Minimally infrequent itemset mining using pattern-growth paradigm and residual trees
Proceedings of the 17th International Conference on Management of Data
Hi-index | 0.00 |
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.We present a new algorithm (BUC) for Iceberg-CUBE computation. BUC builds the CUBE bottom-up; i.e., it builds the CUBE by starting from a group-by on a single attribute, then a group-by on a pair of attributes, then a group-by on three attributes, and so on. This is the opposite of all techniques proposed earlier for computing the CUBE, and has an important practical advantage: BUC avoids computing the larger group-bys that do not meet minimum support. The pruning in BUC is similar to the pruning in the Apriori algorithm for association rules, except that BUC trades some pruning for locality of reference and reduced memory requirements. BUC uses the same pruning strategy when computing sparse, complete CUBEs.We present a thorough performance evaluation over a broad range of workloads. Our evaluation demonstrates that (in contrast to earlier assumptions) minimizing the aggregations or the number of sorts is not the most important aspect of the sparse CUBE problem. The pruning in BUC, combined with an efficient sort method, enables BUC to outperform all previous algorithms for sparse CUBEs, even for computing entire CUBEs, and to dramatically improve Iceberg-CUBE computation.