Competitive caching of query results in search engines

Theoretical Computer Science

Volumn 324, Issue 2-3 SPEC. ISS., 2004, Pages 253-271

  Lempel, Ronny ^a   Moran, Shlomo ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CACHING ALGORITHMS; QUERY GENERATION; STOCHASTIC MODELS;

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES; SEARCH ENGINES; USER INTERFACES; VIRTUAL STORAGE; WORLD WIDE WEB;

BUFFER STORAGE;

EID: 4444230569     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.05.018     Document Type: Article

References (24)

1. Albers S. On the influence of lookahead in competitive paging algorithms. Algorithmica. 18:1997;283-305.
2. Alborzi H., Torng E., Uthaisombut P., Wagner S. The. k-client problem J. Algorithms. 41(2):2001;115-173.
3. Belady L.A. A study of replacement algorithms for a virtual-storage computer. IBM Systems J. 5(2):1966;78-101.
4. Borodin A., El-Yaniv R. Online Computation and Competitive Analysis. 1998;Cambridge University Press, Cambridge.
5. A. Borodin, S. Irani, P. Raghavan, B. Schieber, Competitive paging with locality of reference, in: Proc. 23rd ACM Symp. on Theory of Computing (STOC 1991), 1991, pp. 249-259.
6. Breslauer D. On competitive on-line paging with lookahead. Theoret. Comput. Sci. 209:2:1998;365-375.
7. S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine, in: Proc. 7th Internat. WWW Conf., 1998, pp. 107-117.
8. T. Feder, R. Motwani, R. Panigrahy, A. Zhu, Web caching with request reordering, in: Proc. 13th ACM-SIAM Symp. Discrete Algorithms (SODA), 2002.
9. A. Fiat, A.R. Karlin, Randomized and multipointer paging with locality of reference, in: Proc. 27th Annu. ACM Symp. on Theory of Computing, 1995, pp. 626-634.
10. Fiat A., Karp R.M., Luby M., McGeoch L.A., Sleator D.D., Young N.E. Competitive paging algorithms. J. Algorithms. 12(4):1991;685-699.
11. Goodman R. Introduction to Stochastic Models. 1988;Benjamin/Cummings, Menlo Park, CA.
12. Irani S. Competitive analysis of paging. Fiat A., Woeginger G.J. Online Algorithms, The State of the Art. Lecture Notes in Computer Science. Vol. 1442:1998;52-73 Springer, Berlin.
13. Jansen B.J., Spink A., Saracevic T. Real life, real users, and real needs. a study and analysis of user queries on the web Inform. Process. Manage. 36(2):2000;207-227.
14. Karlin A.R., Phillips S.J., Raghavan P. Markov paging. SIAM J. Comput. 30(3):2000;906-922.
15. Kraiss A., Weikum G. Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions. VLDBJ. 7(3):1998;141-162.
16. R. Lempel, S. Moran, Optimizing result prefetching in web search engines with segmented indices, in: Proc. 28th Internat. Conf. on Very Large Data Bases, Hong Kong, China, 2002, pp. 370-381.
17. R. Lempel, S. Moran, Predictive caching and prefetching of query results in search engines, in: Proc. 12th World Wide Web Conf. (WWW2003), Budapest, Hungary, 2003, pp. 19-27.
18. Lund C., Phillips S., Reingold N. Paging against a distribution and IP networking. J. Comput. and System Sci. 58(1):1999;222-232. URL citeseer.nj.nec.com/94934.html.
19. E.P. Markatos, On caching search engine query results, in: Proc. 5th Internat. Web Caching and Content Delivery Workshop, 2000.
20. McGeoch L.A., Sleator D.D. A strongly competitive randomized paging algorithm. Algorithmica. 6:1991;816-825.
21. P. Saraiva, E. Moura, N. Ziviani, W. Meira, R. Fonseca, B. Ribeiro-Neto, Rank-preserving two-level caching for scalable search engines, in: Proc. 24th Annu. Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval, New Orleans, LA, USA, 2001, pp. 51-58.
22. C. Silverstein, M. Henzinger, H. Marais, M. Moricz, Analysis of a very large altavista query log, Technical Report 1998-014, Compaq Systems Research Center, October, 1998.
23. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules. Comm. ACM. 28:1985;202-208.
24. J.L. Wolf, M.S. Squillante, P.S. Yu, J. Sethuraman, L. Ozsen, Optimal crawling strategies for web search engines, in: Proc. 11th Internat. World Wide Web Conf. (WWW2002), 2002, pp. 136-147.