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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.