Abstract
Data warehouses are accessed by different queries with different frequencies. The portions of data accessed by a query can be treated as a view. When these views are related to each other and defined over overlapping portions of the base data, then it may be more efficient not to materialize all the views, but rather to materialize certain `shared views' from which the query results can be generated. In this paper, we address some issues related to determining this set of shared views to be materialized in order to achieve the best combination of good performance and low maintenance, and provide an algorithm for achieving this goal.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Conference on Distributed Computing Systems |
| Place of Publication | Los Alamitos, CA |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 458-465 |
| Number of pages | 8 |
| ISBN (Print) | 0818678143 , 0818678135 |
| Publication status | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 17th International Conference on Distributed Computing Systems - Baltimore, MD, USA Duration: 27 May 1997 → 30 May 1997 |
Other
| Other | Proceedings of the 1997 17th International Conference on Distributed Computing Systems |
|---|---|
| City | Baltimore, MD, USA |
| Period | 27/05/97 → 30/05/97 |