Supporting ad-hoc ranking aggregates

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2006, Pages 61-72

  Li, Chengkai ^a   Chang, Kevin Chen Chuan ^a   Ilyas, Ihab F ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Aggregate query; Decision support; OLAP; Ranking; Top k query processing

Indexed keywords

DECISION SUPPORT SYSTEMS; MATHEMATICAL OPERATORS; PROGRAM PROCESSORS; QUERY LANGUAGES;

AGGREGATE QUERY; OLAP; RANKING; TOP-K QUERY PROCESSING;

AD HOC NETWORKS;

EID: 34250767109     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142473.1142481     Document Type: Conference Paper

References (36)

1. F. N. Afrati and R. Chirkova. Selecting and using views to compute aggregate queries (extended abstract). In ICDT, pages 383-397, 2005.
2. S. Agarwal, R. Agrawal, P. Deshpande, A. Gupta, J. F. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. In VLDB, pages 506-521, 1996.
3. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cube. In SIGMOD, pages 359-370, 1999.
4. N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, pages 369-380, 2002.
5. M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD, pages 219-230, 1997.
6. K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, pages 346-357, 2002.
7. S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In VLDB, pages 397-410, 1999.
8. S. Chaudhuri, R. Ramakrishnan, and G. Weikum. Integrating DB and IR technologies: What is the sound of one hand clapping? In CIDR, pages 1-12, 2005.
9. S. Chaudhuri and K. Shim. Including group-by in query optimization. In VLDB, pages 354-366, 1994.
10. J. Claussen, A. Kemper, D. Kossmann, and C. Wiesner. Exploiting early sorting and early partitioning for decision support query processing. VLDBJ., 9(3), 2000.
11. S. Cohen, W. Nutt, and A. Serebrenik. Rewriting aggregate queries using views. In PODS, pages 155-166, 1999.
12. D. Donjerkovic and R. Ramakrishnan. Probabilistic optimization of top n queries. In VLDB, 1999.
13. R. Fagin. Combining fuzzy information from multiple systems. In PODS, pages 216-226, 1996.
14. R. Fagin, A. Lote, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
15. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. In VLDB, pages 299-310, San Francisco, CA, USA, 1998.
16. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Fellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. J. Data Mining and Knowledge Discovery, l(1):29-53, 1997.
17. A. Gupta, V. Harinarayan, and D. Quass. Aggregate query processing in data warehousing environments. In VLDB, pages 358-369, 1995.
18. H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman. Index selection for OLAP. In ICDE, pages 208-219, 1997.
19. P. J. Haas and J. M. Hellerstein. Ripple joins for online aggregation. In SIGMOD, pages 287-298, 1999.
20. J. Han, J. Pei, G. Dong, and K. Wang. Efficient computation of iceberg cubes with complex measures. In SIGMOD, 2001.
21. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In SIGMOD Conference, pages 205-216, 1996.
22. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In SIGMOD, pages 171-182, 1997.
23. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754-765, 2003.
24. I. F. Ilyas, R. Shah, W. G. Aref, J. S. Vitter, and A. K. Elmagarmid. Rank-aware query optimization. In SIGMOD, pages 203-214, 2004.
25. C. Li, K. C.-C. Chang, and I. F. Ilyas. Efficient processing of ad-hoc top-fe aggregate queries in OLAP. Technical Report UIUCDCS-R-2005-2596, Department of Computer Science, UIUC, June 2005. http://aim.cs.uiuc.edu
26. C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song. RankSQL: Query algebra and optimization for relational top-k queries. In SIGMOD, pages 131-142, 2005.
27. H.-G. Li, H. Yu, D. Agrawal, and A. E. Abbadi. Ranking aggregates. Technical report, UCSB, July 2004.
28. V. Lin, V. Vassalos, and P. Malakasiotis. MiniCount: Efficient rewriting of COUNT-queries using views. In ICDE, 2006.
29. T. Neumann and G. Moerkotte. A combined framework for grouping and order optimization. In VLDB, 2004.
30. K. A. Ross and D. Srivastava. Fast computation of sparse datacubes. In VLDB, pages 116-125, 1997.
31. D. E. Simmen, E. J. Shekita, and T. Malkemus. Fundamental techniques for order optimization. In SIGMOD, 1996.
32. D. Srivastava, S. Dar, H. V. Jagadish, and A. Y. Levy. Answering queries with aggregation using views. In VLDB, pages 318-329, 1996.
33. A. Tsois and T. K. Sellis. The generalized pre-grouping transformation: Aggregate-query optimization in the presence of dependencies. In VLDB, pages 644-655, 2003.
34. W. P. Yan and P.-Å. Larson. Performing group-by before join. In ICDE, pages 89-100, 1994.
35. W. P. Yan and P.-Å. Larson. Eager aggregation and lazy aggregation. In VLDB'95, pages 345-357, 1995.
36. Y. Zhao, P. Deshpande, and J. F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In SIGMOD, pages 159-170, 1997.