Algorithmic Challenges in Web Search Engines

@article{Henzinger2003AlgorithmicCI,
  title={Algorithmic Challenges in Web Search Engines},
  author={Monika Henzinger},
  journal={Internet Mathematics},
  year={2003},
  volume={1},
  pages={115-123}
}
In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web. 
Highly Cited
This paper has 85 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 52 extracted citations

The robot crawler graph process

Discrete Applied Mathematics • 2018
View 1 Excerpt

Invited Speakers.

INVITED SPEAKERS, Ricardo Baeza-Yates, PROGRAM’s DETAILS
Clinical & experimental ophthalmology • 2016

86 Citations

01020'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 86 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…