Monitoring an Information Source Under a Politeness Constraint

References

• Alizadeh F., Eckstein J., Noyan N., Rudolf G. Arrival rate approximation by nonnegative cubic splines. Oper. Res. (2004) . ForthcomingGoogle Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329Link, Google Scholar
• Bright L., Raschid L. Using latency-recency profiles for data delivery on the Web. Proc. 28th Internat. Conf. Very Large Data Bases (VLDB) (2002) Morgan Kaufmann, San Francisco:550–561Crossref, Google Scholar
• Bright L., Gal A., Raschid L. Adaptive pull-based policies for wide area data delivery. ACM Trans. Database Syst. (2006) 31:631–671Crossref, Google Scholar
• Cao P., Liu C. Maintaining strong cache consistency in the World-Wide Web. IEEE Trans. Comput. (1998) 47:445–457Crossref, Google Scholar
• Carney D., Lee S., Zdonik S. Scalable application-aware data freshening. Proc. IEEE CS Internat. Conf. Data Engrg. (2003) (IEEE Computer Society, Washington, D.C.) 481–492Crossref, Google Scholar
• Chandy K. M., Brown J. C., Dissly C. W., Uhrig W. R. Analytical models for rollback and recovery strategies in database systems. IEEE Trans. Software Engrg. (1975) SE-1:100–110Crossref, Google Scholar
• Cherniack M., Galvez E., Franklin M., Zdonik S. Profile-driven cache management. Proc. IEEE CS Internat. Conf. Data Engrg. (2003) (IEEE Computer Society, Washington, D.C.) 645–656Crossref, Google Scholar
• Cho J., Garcia-Molina H. Synchronizing a database to improve freshness. Proc. ACM-SIGMOD Conf. Management Data (SIGMOD) (2000) (ACM Press, New York) 117–128Crossref, Google Scholar
• Cohen E., Kaplan H. Refreshment policies for Web content caches. Proc. Annual Joint Conf. IEEE Comput. Comm. Societies (IEEE INFOCOM) (2001) (IEEE Communications, New York) 1398–1406Crossref, Google Scholar
• Deolasee P., Katkar A., Panchbudhe P., Ramamritham K., Shenoy P. Adaptive push-pull: Disseminating dynamic Web data. Proc. Internat. World Wide Web Conf. (WWW) (2001) (ACM Press, New York) 265–274Crossref, Google Scholar
• Dey D., Zhang Z., De P. Optimal synchronization policies for data warehouses. INFORMS J. Comput. (2006) 18:229–242Link, Google Scholar
• Franklin M., Zdonik S. Data in your face: Push technology in perspective. Proc. ACM-SIGMOD Conf. Management of Data (SIGMOD) (1998) (ACM Press, New York) 516–519Crossref, Google Scholar
• Gal A., Eckstein J. Managing periodically updated data in relational databases: A stochastic modeling approach. J. ACM (2001) 48:1141–1183Crossref, Google Scholar
• Gal A., Eckstein J., Stoumbos Z. G. Scheduling of data transcription in periodically connected databases. Stoch. Anal. Appl. (2003) 21:1021–1058Crossref, Google Scholar
• Gwertzman J., Seltzer M. World Wide Web cache consistency. Proc. USENIX Annual Tech. Conf. (1996) (USENIX Association, Berkeley, CA) 141–152Google Scholar
• Hoffer J. A., Severance D. G. The use of cluster analysis in physical data base design. Proc. Internat. Conf. Very Large Data Bases (VLDB) (1975) (ACM Press, New York) 69–86Crossref, Google Scholar
• Lee J.-J., Whang K.-Y., Lee B. S., Chang J.-W. An update-risk based approach to TTL estimation in web caching. Proc. Conf. Web Inform. Systems Engrg. (WISE) (2002) (IEEE Computer Society, Washington, D.C.) 21–29Google Scholar
• Naughton J. F., DeWitt D. J., Maier D., Aboulnaga A., Chen J., Galanis L., Kang J., Krishnamurthy R., Luo Q., Prakash N., Ramamurthy R., Shanmugasundaram J., Tian F., Tufte K., Viglas S., Wang Y., Zhang C., Jackson B., Gupta A., Chen R. The Niagara Internet query system. IEEE Data Engrg. Bull. (2001) 24:27–33Google Scholar
• Pandey S., Dhamdhere K., Olston C. WIC: A general-purpose algorithm for monitoring web information sources. Proc. 30th Internat. Conf. Very Large Data Bases (VLDB) (2004) (Morgan Kaufmann, San Francisco) 360–371Crossref, Google Scholar
• Pandey S., Ramamritham K., Chakrabarti S. Monitoring the dynamic web to respond to continuous queries. Proc. Internat. World Wide Web Conf. (WWW) (2003) (ACM Press, New York) 659–668Crossref, Google Scholar
• Ross S.Introduction to Probability Models (1980) 2nd ed.(Academic Press, Amsterdam) Google Scholar
• Sia K., Cho J. Efficient monitoring algorithm for fast news alert. (2005) . Technical report, Computer Science Department, University of California at Los Angeles, Los Angeles, http://oak.cs.ucla.edu/∼cho/papers/sia-blog.pdfGoogle Scholar
• Taylor H. M., Karlin S.An Introduction to Stochastic Modeling (1994) (Academic Press, Amsterdam) Google Scholar
• Wolf J. L., Squillante M. S., Yu P. S., Sethuraman J., Ozsen L. Optimal crawling strategies for web search engines. Proc. Internat. World Wide Web Conf. (WWW) (2002) (ACM Press, New York) 136–147Crossref, Google Scholar
• Yin J., Alvisi L., Dahlin M., Iyengar A. Engineering server-driven consistency for large scale dynamic web services. Proc. Internat. World Wide Web Conf. (WWW) (2001) (ACM Press, New York) 45–57Crossref, Google Scholar