Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms

DOI10.1007/978-3-540-77004-6_16MaRDI QIDQ5458312zbMATH OpenOpenAlexFDO

Authors Sreenivas Gollapudi, Marc-Alexander Najork, 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

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

Recommendations

• Link Analysis: Hubs and Authorities on the World Wide Web
• Compressed Bloom filters
• Stability and Similarity of Link Analysis Ranking Algorithms
• Automata, Languages and Programming
• Network Applications of Bloom Filters: A Survey

Cites work

• scientific article; zbMATH DE number 1303610 (Why is no real title available?)
• Authoritative sources in a hyperlinked environment
• Min-wise independent permutations
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors

Cited in

(1)

• Less Hashing, Same Performance: Building a Better Bloom Filter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458312)