Sciweavers

792 search results - page 2 / 159
» Computing Iceberg Queries Efficiently
Sort
View
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
14 years 7 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu
ICDE
2006
IEEE
215views Database» more  ICDE 2006»
14 years 7 months ago
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes
In this demo we present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporat...
Ying Chen, Andrew Rau-Chaplin, Frank K. H. A. Dehn...
CIKM
2007
Springer
13 years 12 months ago
Ix-cubes: iceberg cubes for data warehousing and olap on xml data
With increasing amount of data being stored in XML format, OLAP queries over these data become important. OLAP queries have been well studied in the relational database systems. H...
Fianny Ming-fei Jiang, Jian Pei, Ada Wai-Chee Fu
DIS
2008
Springer
13 years 7 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
DAWAK
2009
Springer
13 years 3 months ago
BitCube: A Bottom-Up Cubing Engineering
Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used ...
Alfredo Ferro, Rosalba Giugno, Piera Laura Puglisi...