Efficient peer-to-peer keyword searching
Citations
2,199 citations
Cites methods from "Efficient peer-to-peer keyword sear..."
...Reynolds and Vahdat use Bloom filters in a similar fashion as [Byers et al. 02a], except that their goal is to find the set intersection instead of the set difference [Reynolds and Vahdat 03]....
[...]
1,184 citations
532 citations
480 citations
Additional excerpts
...filter-based structures have been developed [73], [74]....
[...]
454 citations
Cites background from "Efficient peer-to-peer keyword sear..."
...Patrick Reynolds and Amin Vahdat [14] proposed an efficient distributed keyword search system, which distributes an inverted index into a distributed hash table, such as Chord or Pastry....
[...]
References
14,696 citations
"Efficient peer-to-peer keyword sear..." refers background or methods in this paper
...Our design is based on the traditional search engine service model [ 3 ]....
[...]
...Web search engines such as Google [ 3 ] operate in a centralized manner....
[...]
...First, if the search service performs ranking based on the number of incident hypertext links [ 3 ], it is likely that documents with inaccurate keywords will be unpopular (people will not link to documents that misrepresent their content)....
[...]
...If documents are ordered according to some relevance metric [ 3 ] (for instance, documents that are linked to more frequently might be considered to have higher “relevance”), we can return the best matching documents....
[...]
14,400 citations
Additional excerpts
...Google’s PageRank algorithm [ 15 ] has successfully exploited the hyperlinked nature of the Web to give high scores to pages linked to by other pages with high scores....
[...]
13,327 citations
10,286 citations
7,390 citations