Open Access 
Downloads
Download data is not yet available.
Abstract
A warehouse is a repository of integrated information drawn from remote data sources. Since a warehouse effectively implements materialized views, we must maintain the views as data sources are updated. A lattice framework is used to express dependencies among views. This paper introduces a greedy algorithm that works off this lattice and determines a good set of views to materialize. A program written by Java illustrated the algorithm.
Author's Affiliation
Article Details
Issue: Vol 6 No 5&6 (2003)
Page No.: 13-21
Published: Jun 30, 2003
Section: Article
DOI: https://doi.org/10.32508/stdj.v6i3&4.3325
Copyright Info
Copyright: The Authors. This is an open access article distributed under the terms of the Creative Commons Attribution License CC-BY 4.0., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
How to Cite
Dang Cao, N. (2003). APPLICATION OF THE GREEDY ALGORITHM FOR SELECTING MATERIALIZED VIEWS IN DATA WAREHOUSE. VNUHCM Journal of Science and Technology Development, 6(5&6), 13-21. https://doi.org/https://doi.org/10.32508/stdj.v6i3&4.3325
Download Citation
Cited by
Article Statistics
HTML = 1035 times
Download PDF = 463 times
Total = 463 times
Download PDF = 463 times
Total = 463 times
Most read articles by the same author(s)
- Nguyen Dang Cao, APPLICATION OF SELF-MAINTAINABLE MATERIALIZED VIEWS ALGORITHM ON DATA WAREHOUSE FOR BANKING PROBLEM , VNUHCM Journal of Science and Technology Development: Vol 6 No 5&6 (2003)
