The week's pick
Reseach Article
Methods for Evaluating Iceberg Queries
by
A. Padmapriya,
T. Shanmuga Priya
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 68 - Number 9 |
| Year of Publication: 2013 |
| Authors: A. Padmapriya, T. Shanmuga Priya |
10.5120/11605-6971
|
A. Padmapriya, T. Shanmuga Priya . Methods for Evaluating Iceberg Queries. International Journal of Computer Applications. 68, 9 ( April 2013), 6-9. DOI=10.5120/11605-6971
@article{
10.5120/11605-6971,
author = {
A. Padmapriya,
T. Shanmuga Priya
},
title = { Methods for Evaluating Iceberg Queries },
journal = {
International Journal of Computer Applications
},
issue_date = { April 2013 },
volume = { 68 },
number = { 9 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = {
6-9
},
numpages = {9},
url = {
https://ijcaonline.org/archives/volume68/number9/11605-6971/
},
doi = { 10.5120/11605-6971 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:27:54.041036+05:30
%A A. Padmapriya
%A T. Shanmuga Priya
%T Methods for Evaluating Iceberg Queries
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 9
%P 6-9
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. Iceberg queries have been recently identified as important queries for many applications. Queries can be characterized by their huge input-small output. The iceberg refers to the input, and the tip of it refers to the output. This paper is going to present some of the existing iceberg query processing using data mining.
References
- Agrawal, R. and Srikant, R. "Fast Algorithms for Mining Association Rules. " Proceedings of the 20th Int'l Conference on Very Large s Databases (VLDB '94), September 1994. A. C. Klug. "Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions". Journal of ACM, 29(3):699–717, 1982.
- Altingovde, I. S. , Ozcan, R. , Ulusoy, Ö. : "Exploiting query views for static index pruning in web search engines". In: Proc. of CIKM'09. (2009) 1951-1954
- Beyer, K. and Ramakrishnan, R. "Bottom-up Computation of Sparse and Iceberg CUBEs. " Proceedings of 1999 ACM SIGMOD Int'l Conference on Management of Data, pp. 359-370, 1999.
- Carmel, D. , Cohen, D. , Fagin, R. , Farchi, E. , Herscovici, M. , Maarek, Y. S. , Soffer, A. ," Static index pruning for information retrieval systems. In: Proc. of SIGIR'01. (2001)
- Comer, D. : The ubiquitous B-tree. Computing Surveys 11(2), 121–137 (1979)
- Chaudhuri, S. , Dayal, U. : "An Overview of Data Warehousing and OLAP Technology". ACM SIGMOD Record 26(1), 65–74 (1997)
- Chaudhuri, S. and Gravano, L. "Evaluating Top-A: Selection Queries. " Proceedings of the 25th Int'l s on Very Large Databases (VLDB '99), pp. 399-410, 1999.
- Donjerkovic, D. and Ramakrishnan, R. "Probabilistic Optimization of Top n Queries. " Proceedings of the 25th Int'l Conference on Very Large Databases (VLDB'99), pp. 411-422, 1999.
- E. Segal, Y. Matias and P. Gibbons, "Online Iceberg Queries".
- Fang, M. , Shivakumar, N. , Garcia-Molina, H. , Motwani, R. and Ullman, J. "Computing Iceberg Queries Efficiently. " Proceedings of the 24th Int'l Conference on Very Large Databases (VLDB '98), 1998.
- G. Graefe, "Query Evaluation Techniques for Large Databases", ACM Comput. Surv. , 25, 2, 73–170, June 1993.
- J. Bae and S. Lee, "Partitioning Algorithms for the Computation of Average Iceberg Queries", DAWAK,2000.
- J. Han et al. , "Efficient Computation of Iceberg Cubes with Complex Measures", Proc. of ACM SIGMOD Conf. , 2000.
- K. A. Ross and D. Srivastava. " Fast Computation of Sparse Datacubes". In VLDB'97, Athens, Greece, pages 116–125, 1997. 1
- K. A. Ross, D. Srivastava, and D. Chatziantoniou. " Complex Aggregation at Mutiple Granularities". In EDBT'98, LNCS vol. 1377, pages 263–277. Springer Verlag, 1998.
- Kevin S. Beyer and Raghu Ramakrishnan "Bottom-up computation of sparse and iceberg cubes". In Proc. of the Int. Conf. on Management of Data (ACM SIGMOD),pages 359-370, 1999.
- K. Beyer and R. Ramakrishnan,"Bottom-Up Computation of sparse and iceberg CUBEs",In Proc. of the ACM SIGMOD Conf. ,Pages 359-370,1999.
- Leela krishna poola"Efficiently evaluating N-iceberg queries".
- L. Cabibbo and R. Torlone. "A Framework for the Investigation of Aggregate Functions in Database Queries". In C. Beeri and P. Buneman, editors, ICDT'99, Jerusalem, Israel, LNCS vol. 1540, pages 383–397.
- L. Libkin, L. Cabibbo" the aggregation operator in the relational algebra ". Springer Verlag, 1999.
- L. Libkin. Expressive Power of SQL. In ICDT'01, London, UK, LNCS vol. 1973, pages 1–21. Springer Verlag, January 2001.
- M. Fang,N. Shivakumar,H. Garua-Molina,R. Motwani,and J. D. Ullam,"Computing iceberg queries Efficiently",In Proc. of 24th VLDB conf. . ,Pages 299-310,1998.
- R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules ", Proc. of 20th Intl. Conf. On Very Large Data Bases, 1994.
- Rosine C ICCHETTI, Noël N OVELLI, Lotfi L AKHAL LIM "APIC: An Efficient Algorithm for Computing Iceberg Datacubes", CNRS FRE-2246 - Université de la Méditerranée, Case 901
- R. Ng, A. Wagner and Y. Yin, "Iceberg-cube Computation with PC Clusters", Proc. of ACM SIGMOD Conf. , 2000.
- Salton, G. "A Theory of Indexing. " Society for Industrial and Applied Mathematics, 1975.
- Selinger et al. , "Access Path Selection in a Relational Database Management System", Proc. of ACM SIGMOD Conf. , 1979.
- Shoshani, A. : "OLAP and statistical databases: similarities and differences. In: Principles Of Database Systems (PODS)", pp. 185–196 (1997)
- S. Brin, R. Motwani, J. D. Ullman, and S. Tsur". Dynamic itemset counting and implication rules for market basket data". In Proc. of the Int. Conf. on Management of Data (ACM SIGMOD), pages 255-264, 1997.
- W. P. Yan and Larson, "Data Reduction through EarlyGrouping", In CASCON, page 74, 1994.
Index Terms
Computer Science
Information Sciences
Keywords