Monitoring the dynamic web to respond to continuous queries

Proceedings of the 12th International Conference on World Wide Web, WWW 2003

Volumn , Issue , 2003, Pages 659-668

  Pandey, Sandeep ^a   Ramamritham, Krithi ^a   Chakrabarti, Soumen ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

allocation policies; continuous queries

Indexed keywords

ALLOCATION POLICIES; CONTINUOUS QUERIES; EXPERIMENTAL EVALUATION; ON-LINE DECISION MAKINGS; PERFORMANCE METRICES; PROBABILISTIC MODELS; SOURCES OF INTERESTS; TRAFFIC FLOW CONTROL;

CAMS; ECONOMICS; RESOURCE ALLOCATION;

WORLD WIDE WEB;

EID: 84880469069     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/775152.775245     Document Type: Conference Paper

References (19)

1. B. E. Brewington and G. Cybenko. How dynamic is the Web? Computer Networks (Amsterdam, Netherlands: 1999), 33(1-6):257-276, 2000.
2. J. Cho and H. Garcia-Molina. The evolution of the web and implications for an incremental crawler. In Proceedings of the Twenty-sixth International Conference on Very Large Databases, 2000.
3. J. Cho and H. García-Molina. Synchronizing a database to improve freshness. In Proceedings of 2000 ACM International Conference on Management of Data(SIGMOD), 30(1-7):161-172, 2000.
4. E. Coffman, J. Z. Liu, and R. R. Weber. Optimal robot scheduling for web search engines. Journal of Scheduling, 1998.
5. C. Cunha, A. Bestavros, and M. Crovella. Characteristics of World Wide Web Client-based Traces. Technical Report BUCS-TR-1995-010, Boston University, CS Dept, Boston, MA 02215, April 1995.
6. D. Fetterly, M. Manasse, M. Najork, and J. Wiener. Crawling towards light: A large scale study of the evolution of Web pages. In First Workshop on Algorithms and Models for the Web-Graph, Vancouver, Canada, nov 2002.
7. B. Fox. Discrete optimization via marginal analysis. Management Science, 13(3):211-216, 1966.
8. G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in x + y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197-208, 1982.
9. A. Heydon and M. Najork. Mercator: A scalable, extensible web crawler. World Wide Web, 2(4):219-229, 1999.
10. T. Ibaraki and N. Katoh. Resource allocation problems: Algorithmic approaches. MIT Press, Cambridge, MA, 1988.
11. J.K.Lenstra, A. Kan, and P.Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
12. L. Liu, C. Pu, and W. Tang. Continual queries for internet scale event-driven information delivery. Knowledge and Data Engineering, 11(4):610-628, 1999. (Pubitemid 30517119)
13. L. Liu, C. Pu, and W. Tang. Webcq: Detecting and delivering information changes on the web. In Proc. Int. Conf. on Information and Knowledge Management (CIKM), 2000.
14. L. Liu, C. Pu, W. Tang, and W. Han. Conquer: A continual query system for update monitoring in the www. International Journal of Computer Systems, Science and Engineering, 1999.
15. M.R.Garey, D.S.Johnson, and R.Sethi. The complexity of flowshop and jobshop scheduling. Mathematics Operation Research, 1:117-129, 1976.
16. C. Olston, B. T. Loo, and J. Widom. Adaptive precision setting for cached approximate values. In SIGMOD Conference, 2001.
17. J. Pitkow and P. Pirolli. Life, death, and lawfulness on the electronic frontier. In Proceedings of the Conference on Human Factors in Computing Systems CHI'97, 1997.
18. J. Wolf, M. Squillante, P.S.Yu, J.Sethuraman, and L. Ozsen. Optimal crawling strategies for web search engines. In WWW, 2002.
19. A. Wolman, G. M. Voelker, N. Sharma, N. Cardwell, A. R. Karlin, and H. M. Levy. On the scale and performance of cooperative web proxy caching. In Symposium on Operating Systems Principles, pages 16-31, 1999.