{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:28:48Z","timestamp":1765484928185},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_60","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T08:46:24Z","timestamp":1128588384000},"page":"677-688","source":"Crossref","is-referenced-by-count":2,"title":["Online View Maintenance Under a Response-Time Constraint"],"prefix":"10.1007","author":[{"given":"Kamesh","family":"Munagala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 31\u201340 (1999)","key":"60_CR1"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. Belady","year":"1966","unstructured":"Belady, L.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal\u00a05, 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"unstructured":"Cao, P., Irani, S.: Cost-aware www proxy caching algorithms. In: Proc. USENIX Symposium on Internet Technologies and Systems, pp. 193\u2013206 (1997)","key":"60_CR3"},{"doi-asserted-by":"crossref","unstructured":"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\u2013390 (2000)","key":"60_CR4","DOI":"10.1145\/335191.335432"},{"unstructured":"Cohen, E., Kaplan, H.: LP-based analysis of greedy-dual size. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 879\u2013880 (1999)","key":"60_CR5"},{"key":"60_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., Young, N.: Competitive paging algorithms. J. Algorithms\u00a012, 685\u2013699 (1991)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. Proc. 41st IEEE Sympos. Foundations of Comput. Sci., 603\u2013612 (2000)","key":"60_CR7","DOI":"10.1109\/SFCS.2000.892328"},{"volume-title":"Materialized Views: Techniques, Implementations and Applications","year":"1999","unstructured":"Gupta, A., Mumick, I.S. (eds.): Materialized Views: Techniques, Implementations and Applications. MIT Press, Cambridge (1999)","key":"60_CR8"},{"doi-asserted-by":"crossref","unstructured":"He, H., Xie, J., Yang, J., Yu, H.: Asymmetric batch incremental view maintenance. In: Proc. 21st Intl. Conf. Data Engineering, pp. 106\u2013117 (2005)","key":"60_CR9","DOI":"10.1109\/ICDE.2005.22"},{"issue":"3","key":"60_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/s00453-001-0125-4","volume":"33","author":"S. Irani","year":"2002","unstructured":"Irani, S.: Page replacement with multi-size pages and applications to web caching. Algorithmica\u00a033(3), 384\u2013409 (2002)","journal-title":"Algorithmica"},{"issue":"4","key":"60_CR11","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/69.790816","volume":"11","author":"L. Liu","year":"1999","unstructured":"Liu, L., Pu, C., Tang, W.: Continual queries for internet scale event-driven information delivery. IEEE Trans. Knowledge and Data Engineering\u00a011(4), 610\u2013628 (1999)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"60_CR12","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L. McGeoch","year":"1991","unstructured":"McGeoch, L., Sleator, D.: A strongly competitive randomized paging algorithm. Algorithmica\u00a06, 816\u2013825 (1991)","journal-title":"Algorithmica"},{"issue":"2","key":"60_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/376284.375723","volume":"30","author":"Benjamin Nguyen","year":"2001","unstructured":"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\u2013448 (2001)","journal-title":"ACM SIGMOD Record"},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"60_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N. Young","year":"1994","unstructured":"Young, N.: The k-server dual and loose competitiveness for paging. Algorithmica\u00a011, 525\u2013541 (1994)","journal-title":"Algorithmica"},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00453-001-0124-5","volume":"33","author":"N. Young","year":"2002","unstructured":"Young, N.: On-line file caching. Algorithmica\u00a033, 371\u2013383 (2002)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:50:47Z","timestamp":1605624647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11561071_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}