Abstract
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.
Research is supported in part by NSF CAREER award under grant IIS-0238386.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 31–40 (1999)
Belady, L.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)
Cao, P., Irani, S.: Cost-aware www proxy caching algorithms. In: Proc. USENIX Symposium on Internet Technologies and Systems, pp. 193–206 (1997)
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)
Cohen, E., Kaplan, H.: LP-based analysis of greedy-dual size. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 879–880 (1999)
Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., Young, N.: Competitive paging algorithms. J. Algorithms 12, 685–699 (1991)
Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. Proc. 41st IEEE Sympos. Foundations of Comput. Sci., 603–612 (2000)
Gupta, A., Mumick, I.S. (eds.): Materialized Views: Techniques, Implementations and Applications. MIT Press, Cambridge (1999)
He, H., Xie, J., Yang, J., Yu, H.: Asymmetric batch incremental view maintenance. In: Proc. 21st Intl. Conf. Data Engineering, pp. 106–117 (2005)
Irani, S.: Page replacement with multi-size pages and applications to web caching. Algorithmica 33(3), 384–409 (2002)
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)
McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica 6, 816–825 (1991)
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)
Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)
Young, N.: The k-server dual and loose competitiveness for paging. Algorithmica 11, 525–541 (1994)
Young, N.: On-line file caching. Algorithmica 33, 371–383 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Munagala, K., Yang, J., Yu, H. (2005). Online View Maintenance Under a Response-Time Constraint. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_60
Download citation
DOI: https://doi.org/10.1007/11561071_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)