3 search results - page 1 / 1 » Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms |
WAW
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
JSAC
2006
13 years 5 months ago
2006
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...