A comparison of five probabilistic view-size estimation techniques in OLAP

DOLAP: Proceedings of the ACM International Workshop on Data Warehousing and OLAP

Volumn , Issue , 2007, Pages 17-24

  Aouiche, Kamel ^a   Lemire, Daniel ^a  

^a Tel e University of Quebec   (Canada)

Author keywords

data warehouse; materialized views; OLAP; random hashing; view size estimation

Indexed keywords

BUDGET CONTROL; STOCHASTIC SYSTEMS;

ESTIMATION TECHNIQUES; MATERIALIZED VIEW; OLAP; PROBABILISTIC TECHNIQUE; PROBABILISTICS; RANDOM HASHING; SIZE ESTIMATION; STOCHASTICS; VIEW-SIZE ESTIMATION;

DATA WAREHOUSES;

EID: 79953037858     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1317331.1317335     Document Type: Conference Paper

References (20)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In STOC '96, pages 20-29, 1996.
3. K. Aouiche, P. Jouve, and J. Darmont. Clustering-based materialized view selection in data warehouses. In ADBIS'06, volume 4152 of LNCS, pages 81-95, 2006.
4. K. Aouiche and D. Lemire. Unassuming view-size estimation techniques in OLAP. In ICEIS'07, pages 145-150, 2007.
5. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM'02, pages 1-10, 2002.
6. M. Cai, J. Pan, Y.-K. Kwok, and K. Hwang. Fast and accurate traffic matrix measurement using adaptive cardinality counting. In MineNet'05, pages 205-206, 2005.
7. M. Durand and P. Flajolet. Loglog counting of large cardinalities. In ESA'03, volume 2832 of LNCS, pages 605-617, 2003.
8. C. Faloutsos, Y. Matias, and A. Silberschatz. Modeling skewed distribution using multifractals and the 80-20 law. In VLDB'96, pages 307-317, 1996.
9. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. In VLDB'98, pages 299-310, 1998.
10. P. Flajolet and G. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31(2):182-209, 1985.
11. P. B. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In SPAA'01, pages 281-291, 2001.
12. M. Golfarelli and S. Rizzi. A methodological framework for data warehouse design. In DOLAP'98, pages 3-9, 1998.
13. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In ICDE '96, pages 152-159, 1996.
14. H. Gupta. Selection of views to materialize in a data warehouse. In ICDT'97, pages 98-112, 1997.
15. P. Haas, J. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. In VLDB'95, pages 311-322, 1995.
16. S. Hettich and S. D. Bay. The UCI KDD archive. http://kdd.ics.uci.edu, last checked on 23/10/2006, 2000.
17. D. Lemire and O. Kaser. One-pass, one-hash n-gram count estimation. Technical Report TR-06-001, Dept. of CSAS, UNBSJ, 2006. available from http://arxiv.org/abs/cs.DB/0610010.
18. J. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. In SODA'93, pages 331-340, 1993.
19. TPC. DBGEN 2.4.0. http://www.tpc.org/tpch/, last checked on 23/10/2006, 2006.
20. K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst., 15(2):208-229, 1990.