Competitive caching of query results in search engines

DOI10.1016/j.tcs.2004.05.018zbMath1072.68003OpenAlexW1984212602MaRDI QIDQ1887088

Ronny Lempel, Shlomo Moran

Publication date: 23 November 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.018

zbMATH Keywords

web search enginesdiscrete time stochastic model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly competitive randomized paging algorithm
• Online algorithms. The state of the art
• On competitive on-line paging with lookahead
• Paging against a distribution and IP networking
• On the influence of lookahead in competitive paging algorithms
• The k-Client Problem
• Competitive paging algorithms
• Markov Paging