Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms

DOI10.1007/978-3-540-77004-6_16zbMath1136.68326OpenAlexW1869106409MaRDI QIDQ5458312

Marc-Alexander Najork, Sreenivas Gollapudi, Rina Panigrahy

Publication date: 11 April 2008

Published in: Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77004-6_16

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Min-wise independent permutations
• Authoritative sources in a hyperlinked environment
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms