Online View Maintenance Under a Response-Time Constraint

  • Kamesh Munagala
  • Jun Yang
  • Hai Yu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)


A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When the underlying base tables change, the materialized view also needs to be updated accordingly to reflect those changes. We consider the problem of batch-incrementally maintaining a materialized view under a response-time constraint. We propose techniques for selectively processing updates to some base tables while keeping others batched, with the goal of minimizing the total maintenance cost while meeting the response-time constraint. We reduce this to a generalized paging problem, where the cost of evicting a page is a concave non-decreasing function of the number of continuous requests seen since the last time it was evicted. Our main result is an online algorithm that achieves a constant competitive ratio for all concave cost functions while relaxing the response-time constraint by a constant factor. For several special classes of cost functions, the competitive ratio can be improved with simpler, more intuitive algorithms. Our algorithms are based on emulating the behavior of an online paging algorithm on a page request sequence carefully designed from the cost function. The key novel technical ideas are twofold. The first involves discretizing the cost function, so that there is a collection of periodic paging sequences, with page sizes decreasing geometrically, which approximates the behavior of the original function. The second involves designing an online view maintenance algorithm based on the paging process, by emulating the behavior of the paging scheme in recursively defined phases.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 31–40 (1999)Google Scholar
  2. 2.
    Belady, L.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)CrossRefGoogle Scholar
  3. 3.
    Cao, P., Irani, S.: Cost-aware www proxy caching algorithms. In: Proc. USENIX Symposium on Internet Technologies and Systems, pp. 193–206 (1997)Google Scholar
  4. 4.
    Chen, J., DeWitt, D.J., Tian, F., Wang, Y.: NiagraCQ: A scalable continuous query system for internet databases. In: Proc. 19th ACM SIGMOD Intl. Conf. Management of Data, pp. 379–390 (2000)Google Scholar
  5. 5.
    Cohen, E., Kaplan, H.: LP-based analysis of greedy-dual size. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 879–880 (1999)Google Scholar
  6. 6.
    Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., Young, N.: Competitive paging algorithms. J. Algorithms 12, 685–699 (1991)MATHCrossRefGoogle Scholar
  7. 7.
    Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. Proc. 41st IEEE Sympos. Foundations of Comput. Sci., 603–612 (2000)Google Scholar
  8. 8.
    Gupta, A., Mumick, I.S. (eds.): Materialized Views: Techniques, Implementations and Applications. MIT Press, Cambridge (1999)Google Scholar
  9. 9.
    He, H., Xie, J., Yang, J., Yu, H.: Asymmetric batch incremental view maintenance. In: Proc. 21st Intl. Conf. Data Engineering, pp. 106–117 (2005)Google Scholar
  10. 10.
    Irani, S.: Page replacement with multi-size pages and applications to web caching. Algorithmica 33(3), 384–409 (2002)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Liu, L., Pu, C., Tang, W.: Continual queries for internet scale event-driven information delivery. IEEE Trans. Knowledge and Data Engineering 11(4), 610–628 (1999)CrossRefGoogle Scholar
  12. 12.
    McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Nguyen, B., Abiteboul, S., Cobena, G., Preda, M.: Monitoring XML data on the web. In: Proc. 20th ACM SIGMOD Intl. Conf. Management of Data, pp. 437–448 (2001)Google Scholar
  14. 14.
    Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Young, N.: The k-server dual and loose competitiveness for paging. Algorithmica 11, 525–541 (1994)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Young, N.: On-line file caching. Algorithmica 33, 371–383 (2002)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kamesh Munagala
    • 1
  • Jun Yang
    • 1
  • Hai Yu
    • 1
  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA

Personalised recommendations