Online view maintenance under a response-time constraint

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 677-688

  Munagala, Kamesh ^a   Yang, Jun ^a   Yu, Hai ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA REDUCTION; FUNCTION EVALUATION; ONLINE SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

DATA SETS; MAINTENANCE ALGORITHMS; ONLINE VIEW MAINTENANCE; RESPONSE-TIME CONSTRAINT;

COMPUTER SOFTWARE MAINTENANCE;

EID: 27144455371     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_60     Document Type: Conference Paper

References (16)

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