Optimal Update Policies for Distributed Materialized Views

  • Arie Segev

    Walter A. Haas School of Business, University of California at Berkeley, Berkeley, California 94720 and Information & Computing Sciences Division, Lawrence Berkeley Laboratory, Berkeley, California 94720

    Search for more papers by this author

    ,
  • Weiping Fang

    Industrial Engineering & Operations Research Department, University of California at Berkeley, Berkeley, California 94720 and Information & Computing Sciences Division, Lawrence Berkeley Laboratory, Berkeley, California 94720

    Search for more papers by this author

Published Online:https://doi.org/10.1287/mnsc.37.7.851

In this paper we present an analysis of the problem of determining optimal policies for updating distributed materialized views. We demonstrate the general application of materialized views, and define the concept of materialized view currency and allow a query to specify its currency requirement. We also allow a materialized view to be updated from either a base relation or another materialized view. This flexibility provides an opportunity for further reduction in the cost of maintaining distributed materialized views. We model the problem of optimal update policies to capture currency and policy constraints, replicated data, and various view update policies. The optimization incorporates a minimum-cost objective function as well as user's response time constraints.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.