A view selection algorithm with performance guarantee

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

Volumn , Issue , 2009, Pages 946-957

  Hanusse, Nicolas ^a   Maabout, Sofian ^a   Tofan, Radu ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; EXPERIMENTAL COMPARISON; OPTIMAL SOLUTIONS; PERFORMANCE GUARANTEES; QUERY RESPONSE TIME; RESPONSE TIME; SPEED-UPS; TIME COMPLEXITY; VIEW SELECTION;

DATA WAREHOUSES;

APPROXIMATION ALGORITHMS;

EID: 70349143956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516468     Document Type: Conference Paper

References (16)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB Proceedings, 1994.
2. K. Aouiche and D. Lemire. A comparison of five probabilistic view-size estimation techniques in olap. In DOLAP Proceedings, 2007.
3. R. Bayardo. Efficiently mining long patterns from databases. In SIGMOD Proceedings, 1998.
4. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE Proceedings, 2001.
5. K. Gouda and M. J. Zaki. GenMax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery, ll(3):223-242, 2005.
6. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Mining and Knowledge Discovery, l(l):29-53, 1997.
7. D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, and R. S. Sharm. Discovering all most specific sentences. A CM Transactions on Database Systems, 28(2): 140-174, 2003.
8. H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman. Index selection for olap. In ICDE Proceedings, 1997.
9. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In SIGMOD Proceedings, 1996.
10. H. J. Karloff and M. Mihail. On the complexity of the view-selection problem. In PODS Proceedings, 1999.
11. X. Li, J. Han, and H. Gonzalez. High-dimensional olap: A minimal cubing approach. In VLDB Proceedings, 2004.
12. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mininig and Knowledge Discovery, l(3):241-258, 1997.
13. H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In KDD Workshop, 1994.
14. K. Satoh and T. Uno. Enumerating maximal frequent sets using irredundant dualization. In Discovery Science conference proceedings, 2003.
15. A. Shukla, P. M. Deshpande, and J. F. Naughton. Materialized view selection for multidimensional datasets. In VLDB Proceedings, 1998.
16. Z. A. Talebi, R. Chirkova, Y. Fathi, and M. Stallmann. Exact and inexact methods for selecting views and indexes for olap performance improvement. In EDBT Proceedings, 2008.