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

Creative Commons License

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. Science and Technology Development Journal, 6(5&6), 13-21. https://doi.org/https://doi.org/10.32508/stdj.v6i3&4.3325

 Cited by



Article level Metrics by Paperbuzz/Impactstory
Article level Metrics by Altmetrics

 Article Statistics
HTML = 796 times
Download PDF   = 360 times
Total   = 360 times