Abstract
With the rapid increase of the distributed databases the fast retrieval of the data from these databases are playing an important role. The bitmap index technique is well known data structure to provide fast search from large collections. The iceberg queries are frequently used where small output is required from large inputs. Recently, the bitmap indices with compression technique (WAH) are being utilized for efficient iceberg query evaluation. However, the results of these techniques are available only with standalone database. In this paper, we present an effective iceberg query evaluation by developing deferred strategy in distributed databases. This reduced the AND operations performed excessively in existing algorithm. The proposed algorithm executes in both the ways of data shipping and query shipping. The experimental results are verified and compared with existing algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani and J.D. Ullman. “Computing Iceberg Queries Efficiently”. In VLDB, pages 299–310, 1998.
Spiegler I; Maayan R “Storage and retrieval considerations of binary databases”. Information processing and management: an international journal 21(3): pages 233–254, 1985.
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.
G. Antoshenkov, “Byte-aligned Bitmap Compression”, Proceedings of the Conference on Data Compression, IEEE Computer Society, Washington, DC, USA, Mar 28–30,1995, pp. 476.
Jinuk Bae, Sukho Lee, “Partitioning Algorithms for the Computation of Average Iceberg Queries”, Springer-Verlag, ISBN:3-540-67980-4, 2000, pp: 276–286.
K. P. Leela, P. M. Tolani, and J. R. Haritsa. “On Incorporating Iceberg Queries in Query Processors”, in DASFAA, 2004, pages 431–442.
J. Baeand, S. Lee, “Partitioning Algorithms for the Computation of Average Iceberg Queries”, in DaWaK, 2000.
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.
P.E. O’Neil and G. Graefe. “Multi-Table Joins Through Bitmapped Join Indices”. SIGMOD Record, 24(3):8–11, 1995.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Shankar, V., Guru Rao, C.V. (2016). Efficient Iceberg Query Evaluation in Distributed Databases by Developing Deferred Strategies. In: Satapathy, S., Mandal, J., Udgata, S., Bhateja, V. (eds) Information Systems Design and Intelligent Applications. Advances in Intelligent Systems and Computing, vol 433. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2755-7_44
Download citation
DOI: https://doi.org/10.1007/978-81-322-2755-7_44
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2753-3
Online ISBN: 978-81-322-2755-7
eBook Packages: EngineeringEngineering (R0)