Name
Abstract | ||
|---|---|---|
Recent advances in peer to peer (P2P) search algorithms have presented viable structured and unstructured approaches for full-text search. We posit that these existing approaches are each best suited for different types of queries. We present PHIRST, the first system to facilitate effective full-text search within P2P networks. PHIRST works by effectively leveraging between the relative strengths of these approaches. Similar to structured approaches, agents first publish terms within their stored documents. However, frequent terms are quickly identified and not exhaustively stored, resulting in a significantly reduction in the system's storage requirements. During query lookup, agents use unstructured searches to compensate for the lack of fully published terms. Additionally, they explicitly weigh between the costs involved with structured and unstructured approaches, allowing for a significant reduction in query costs. We evaluated the effectiveness of our approach using both real-world and artificial queries. We found that in most situations our approach yields near perfect recall. We discuss the limitations of our system, as well as possible compensatory strategies. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-75119-9_5 | CIA |
Keywords | Field | DocType |
effective full-text search,artificial query,unstructured approach,p2p network,approach yield,unstructured search,search algorithm,existing approach,hybrid p2p free-text search,full-text search,structured approach,p2p | Publication,Inverted index,Data mining,Architecture,Search algorithm,Peer-to-peer,Computer science,Full text search,Search cost,Recall | Conference |
Volume | ISSN | Citations |
4676 | 0302-9743 | 3 |
PageRank | References | Authors |
0.46 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Avi Rosenfeld | 1 | 216 | 24.80 |
| Claudia V. Goldman | 2 | 726 | 64.56 |
| Gal A. Kaminka | 3 | 1631 | 158.78 |
| Sarit Kraus | 4 | 6810 | 768.04 |