Storing auxiliary data for efficient maintenance and lineage tracing of complex views

As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inecient. Storing auxiliary views in the ware-house can reduce the complexity and improve the eciency of view maintenance, and the same auxiliary views can help in eciently answering lineage tracing queries over the ware-house views. In this paper, we study the problem of selecting auxiliary views to materialize in order to minimize the total view maintenance and lineage tracing cost. We consider relational views with arbitrary use of aggregation operators, and we dene an initial search space for our optimization problem based on a normal form for such view denitions. We present several auxiliary view selection algorithms, and to study their performance we conduct experiments using the TPC-D benchmark in addition to synthetic view denitions and statistics. The results of our experiments show: (1) the exhaustive algorithm that selects the optimal set of auxiliary views is far too expensive in many cases; (2) two heuristic algorithms that we present select good (often optimal) sets of auxiliary views in a much shorter time; (3) even auxiliary views selected by a very simple algorithm can signicantly reduce the overall view maintenance and lineage tracing cost.