Average Iceberg Queries Computation With State Buckets Counter

Pallam Ravi; D. Haritha

doi:https://doi.org/10.14445/22315381/IJETT-V68I8P210S

Research Article | Open Access | Download PDF

Volume 68 | Issue 8 | Year 2020 | Article Id. IJETT-V68I8P210S | DOI : https://doi.org/10.14445/22315381/IJETT-V68I8P210S

Average Iceberg Queries Computation With State Buckets Counter

Pallam Ravi, D. Haritha

Citation :

Pallam Ravi, D. Haritha, "Average Iceberg Queries Computation With State Buckets Counter," International Journal of Engineering Trends and Technology (IJETT), vol. 68, no. 8, pp. 53-57, 2020. Crossref, https://doi.org/10.14445/22315381/IJETT-V68I8P210S

Abstract

In limited memory environment computing Aggregate values needs many scan of data, o avoid these scans use apriori property for computing antimonotone iceberg queries but with efficient use bucket counter reduce scans for computing non antimonotone iceberg queries, till now all algorithms use single state Bucket counters, which suffers massive counter checking for candidates, we propose two state Bucket counter which reduce counter checking, we conduct experiment on POP algorithm.

Keywords

Iceberg queries, Bitmap Index, Aggregate Function, Value-based Property.

References

[1] M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J.D. Ullman, “Computing Iceberg Queries Efficiently”, Proc. Int’l Conf. Very Large Data Bases (VLDB), pp. 299-310, 1998.
[2] C.Y. Chan and Y.E. Ioannidis, “Bitmap Index Design and Evaluation”, Proc. ACM SIGMOD Intl Conf. Management of Data, 1998.
[3] J.Bae and S.Lee. ”Partitioning algorithms for the computation of average iceberg queries.” Proc. Second Intl Conf. Data Warehousing and Knowl-edge Discovery (DaWaK), pp. 276- 286, 2000.
[4] K.P. Leela, P.M. Tolani, and J.R. Haritsa, “On Incorporating Iceberg Queries in Query Processors”, Proc. Intl Conf. Database Systems for Advances Applications (DASFAA), pp. 431- 442, 2004.
[5] J. Han, J. Pei, G. Dong, and K. Wang, “Efficient Computation of Iceberg Cubes with Complex Measures”, Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 1-12, 2001.
[6] B.He,H-I.Hsia,Z.Liu,Y.Huang and Y.Chen “Efficent computing Iceberg queries using compresed bitmap index” IEEE TRANSACTION ON KNOWLEDGE AND DATA ENGINEERING,2012‘
[7] Vuppu shanker et al .”Effective Iceberg Query Evaluation by Deferring Push and Pop Operations,IJAC, ISSN:2051-0845, Vol.36, Issue.2.2015
[8] Vuppu shanker et al,” Cache Based Evaluation of Iceberg Queries” ICCCT-2014 IEEE,2014
[9] Vuppu shanker et al, Answering Iceberg Queries Efficiently Using Check Point Mechanism,IJAC , Vol.46, Issue.2,2015
[10] Pallam Ravi et al “COMPUTING ICEBERG QUERIES HAVING NON ANTI MONOTONE CONSTRAINS WITH BIT MAP NUMBER”, JATIT,Vol. 8. No. 2 – 2016
[11] Kale Sarika Prakash et al,”Tracking Pointer and Look Ahead Matching Strategy to Evaluate Iceberg Query”.JCS,2017
[12] Y.Cui, W.Perrizo ”Aggregate Function Computation and Iceberg Query-ing in Vertical Database”,Computers and Their Applications,2006
[13] Vuppu shanker et al “Efficient iceberg evaluation in Distributed databases by Developing Deferred Strategies”,2016
[14] K.S. Beyer and R. Ramakrishnan, “Bottom-Up Computation of Sparse and Iceberg CUBEs”, Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 359-370, 1999.