Entropy based approximate querying and exploration of datacubes

Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM

Volumn , Issue , 2001, Pages 81-90

  Palpanas, T ^a   Koudas, N ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATA REDUCTION; INFORMATION THEORY; INVERSE PROBLEMS; LAGRANGE MULTIPLIERS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; QUERY LANGUAGES; STATISTICAL METHODS; THEOREM PROVING;

APPROXIMATE QUERY ANSWERING; DATA SET; DATACUBES; INFORMATION ENTROPY; MAXIMUM ENTROPY;

DATA HANDLING;

EID: 53949121843     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Approximate query processing with summary tables in statistical databases
2. Join synopses for approximate query answering
3. A linear method for deviation detection in large databases
4. Using loglinear models to compress datacubes
5. A maximum entropy approach to natural language modelling
6. On a least square adjustment of a sampled frequency table when the expected marginal totals are known
7. Recovering information from summary data
8. Optimal histograms with quality guarantees
9. View maintenance issues in the chronicle data model
10. Algorithms for mining distance-based outliers in large datasets
11. A universal scheme approach to statistical databases containing homogeneous summary tables
12. Random sampling techniques for space efficient online computation of order statistics of large datasets
13. Entropy based approximate querying and exploration of datacubes
14. Improved histograms for selectivity estimation of range predicates
15. Discovery-driven exploration of OLAP data cubes
16. Compressed data cubes for OLAP aggregate query approximation on continuous dimensions
17. What makes patterns interesting in knowledge discovery systems
18. Data cube approximation and histograms via wavelets