2007•Unpublished venueRequires access

Strategy of Selecting Materialized Views Based on Cache-updating

Guisheng Yin, Yu Xiang, Liandong Lin

Abstract

An effective method to reduce the time of response time about query is to materialize views in data warehouse. Current strategies mainly consider the methods of the primary selection of materialized views. Due to the insufficient consideration of the dynamic refreshment, we address a new dynamic method which can wash out materialized views and add new materialized views in the set of current materialized views on the basis of the greedy algorithm.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Materialized view, Computer science, Cache, Selection (genetic algorithm), Set (abstract data type), Data warehouse, Response time, Greedy algorithm