Abstract
In view of some deficiencies which traditional static materialized view selection algorithms have, the paper brings forward an efficient materialized view selection adjustment algorithm which could overcome some deficiencies such as large storage, long running time and different querying probability. Besides, the algorithm can be carried out simultaneously from source data to data warehouse immediately when the changes occur in source database. It integrates some advantages such as PBS, IGA and so on, performances of the algorithm has been proved in experiment. The efficient materialized view selection adjustment algorithm reduces search spaces and shortens running time. Most of all, the algorithm considers materialized views mutual relations in influencing view benefit. Consequently, the algorithm can be dynamicly adjusted online and attains anticipative purpose. It makes some contributions for materialized view selection.
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 callDisclaimer: 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.
