Sciweavers

38 search results - page 1 / 8
» A probabilistic model for data cube compression and query ap...
Sort
View
DOLAP
2007
ACM
13 years 9 months ago
A probabilistic model for data cube compression and query approximation
Rokia Missaoui, Cyril Goutte, Anicet Kouomou Choup...
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 9 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
VLDB
2001
ACM
139views Database» more  VLDB 2001»
13 years 9 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
DCC
2011
IEEE
13 years 7 days ago
Deplump for Streaming Data
We present a general-purpose, lossless compressor for streaming data. This compressor is based on the deplump probabilistic compressor for batch data. Approximations to the infere...
Nicholas Bartlett, Frank Wood
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 8 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli