CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Framework to Process Iceberg Queries using Set-intersection and Set-Difference Operations

by Ch. Chaitanya Bharathi, V. Shankar, B. Hanmanthu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 81 - Number 7
Year of Publication: 2013
Authors: Ch. Chaitanya Bharathi, V. Shankar, B. Hanmanthu
10.5120/14025-2179

Ch. Chaitanya Bharathi, V. Shankar, B. Hanmanthu . A Framework to Process Iceberg Queries using Set-intersection and Set-Difference Operations. International Journal of Computer Applications. 81, 7 ( November 2013), 22-27. DOI=10.5120/14025-2179

@article{ 10.5120/14025-2179,
author = { Ch. Chaitanya Bharathi, V. Shankar, B. Hanmanthu },
title = { A Framework to Process Iceberg Queries using Set-intersection and Set-Difference Operations },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 81 },
number = { 7 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 22-27 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume81/number7/14025-2179/ },
doi = { 10.5120/14025-2179 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:55:28.438332+05:30
%A Ch. Chaitanya Bharathi
%A V. Shankar
%A B. Hanmanthu
%T A Framework to Process Iceberg Queries using Set-intersection and Set-Difference Operations
%J International Journal of Computer Applications
%@ 0975-8887
%V 81
%N 7
%P 22-27
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Many data mining queries are basically identified as iceberg queries. Applications are required to be compute aggregate functions over an interesting attributes to find aggregate values above some specified threshold. Such queries are called as iceberg queries. We propose set operations instead of bitwise-AND operations to evaluate iceberg queries efficiently using very little memory and significantly fewer passes over data, as compared to current techniques that use Dynamic pruning approaches and Vector alignment algorithms. Set operations reduces the execution time and make evaluation process of Iceberg query very effective by reducing the number of bitmaps that are needed. The exhaustive experimentation gives better results than existing strategies.

References
  1. Bin He, Hui-I Hsiao, Ziyang Liu, Yu Huang and Yi Chen, "Efficient Iceberg Query Evaluation Using Compressed Bitmap Index", IEEE Transactions On Knowledge and Data Engineering, vol 24, issue 9, sept 2011, pp. 1570-1589
  2. D. E. Knuth, "The Art of Computer Programming : A Foundation for computer mathematics" Addison-Wesley Professional, second edition, ISBN NO: 0-201-89684-2, January 10, 1973.
  3. G. Antoshenkov, "Byte-aligned Bitmap Compression", Proceedings of the Conference on Data Compression, IEEE Computer Society, Washington, DC, USA, Mar28-30,1995, pp. 476
  4. Hsiao H, Liu Z, Huang Y, Chen Y, "Efficient Iceberg Query Evaluation using Compressed Bitmap Index", in Knowledge and Data Engineering, IEEE, Issue: 99, 2011, pp:1.
  5. Jinuk Bae,Sukho Lee, "Partitioning Algorithms for the Computation of Average Iceberg Queries", Springer-Verlag, ISBN:3-540-67980-4, 2000, pp: 276 – 286.
  6. J. Baeand, S. Lee, "Partitioning Algorithms for the Computation of Average Iceberg Queries", in DaWaK, 2000.
  7. K. P. Leela, P. M. Tolani, and J. R. Haritsa. "On Incorporating Iceberg Queries in Query Processors", in DASFAA, 2004, pages 431–442.
  8. K. Stockinger, J. Cieslewicz, K. Wu, D. Rotem and A. Shoshani. "Using Bitmap Index for Joint Queries on Structured and Text Data", Annals of Information Systems, 2009, pp: 1–23.
  9. K. Wu,E. J. Otoo and A. Shoshani. "Optimizing Bitmap Indices with Ef?cient Compression", ACM Transactions on Database System, 31(1):1–38, 2006.
  10. K. Wu,EJ. Otoo,and A. Shoshani, "On the Performance of Bitmap Indices for High Cardinality Attributes", VLDB, 2004, pp: 24–35.
  11. K. -Y. Whang, B. T. V. Zanden and H. M. Taylor. "A Linear-Time Probabilistic Counting Algorithm for Database Applications". ACMTrans. Database Syst. , 15(2):208–229, 1990.
  12. M. Fang, N. Shivakumar, H. Garcia- Molina, R. Motwani and J. D. Ullman. "Computing Iceberg Queries Ef?ciently". In VLDB, pages 299–310, 1998.
  13. M. Jrgens "Tree Based Indexes vs. Bitmap Indexes: A Performance Study" In DMDW, 1999.
  14. M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau,A. Lin, S. Madden, E. J. O'Neil, P. E. O'Neil, A. Rasin, N. Tran and S. B. Zdonik. C-Store: "A Column-oriented DBMS". In VLDB, pages 553–564, 2005.
  15. P. E. O'Neil. "Model204 Architecture and Performance". In HPTS Pages 40–59, 1987.
  16. P. E. O'Neiland D. Quass. "Improved Query Performance with Variant Indexes". In SIGMOD Conference, pages 38–49, 1997.
  17. P. E. O'Neil and G. Graefe. "Multi-Table Joins Through Bitmapped Join Indices". SIGMOD Record, 24(3):8–11, 1995.
  18. R. Agarwal,T. Imilinski,andA. Swami. "MiningA ssociation Rules between Sets of Items in Large databases". In SIGMOD Conference, pages 207-216, 1993.
  19. Spiegler I; Maayan R "Storage and retrieval considerations of binary databases". Information processing and management: an international journal 21 (3): pages 233-54, 1985.
Index Terms

Computer Science
Information Sciences

Keywords

Database Iceberg query Bitmap vector Set intersection set difference and Threshold

Powered by PhDFocusTM