Improving efficiency of peer-to-peer search

Improving efficiency of peer-to-peer search,B. Yang,H. Garcia-molina

Improving efficiency of peer-to-peer search (Citations: 13)


	BibTex \| RIS \| RefWorks Download

Published in 2002.

Cumulative Annual

Citation Context (8)

- ...[20] and [5] support keyword queries with regular expressions...
- ...Existing P2P systems, such as [20], [5], [9], [3], [1] etc, summarize the peers/documents by keyword vectors which contain pairs of keyword and its weight...
Heng Tao Shen, et al. Efficient Semantic-Based Content Search in P2P Network
- ...Different refinements of forwarding-based techniques have been studied, such as arranging good topologies for the overlay [4, 6], intelligent forwarding of messages within the overlay [22, 5, 20, 17], the use of lightweight indices, data replication [3], and many combinations of the above [2]...
- ...However, references [5, 22] show that incremental forwarding of query messages and intelligent peer selection greatly improves search performance without affecting quality of results...
- ...We also note that to a limited extent, techniques such as routing indices [5] and directed breadth-first-search [22] allow peers in Gnutella to control the order in which peers receive their query...
- ...Again, to a limited degree, techniques such as iterative deepening [22] allow peers to control the extent of the query...
- ...Figure 8 shows the tradeoff curve between the average cost of a query and the unsatisfaction rate for three different search mechanisms: a fixed-extent mechanism (e.g., Gnutella), a coarse-grained flexible extent mechanism (e.g., the iterative deepening [22] approach), and a fine-grained flexible extent mechanism (e.g., GUESS)...
Beverly Yang, et al. Evaluating GUESS and Non-Forwarding Peer-to-Peer Search
- ...Much research has also been focused on improving search efficiency by designing good search protocols; for example, Chord [20], Pastry [17], CAN [16], and Tapestry [25] in the specific context of supporting point queries, and [3, 24] in the context of supporting more expressive queries (e.g., keyword query with regular expressions)...
- ...Other routing protocols such as those described in [3, 24] may send the queryto a select subsetof neighbors, for efficiency...
- ...These values, listed in Table 3, were gathered throughobservationof theGnutellanetworkovera1-month period, described in [24]...
- ...For our evaluations, we assume the use of the simple baseline search used in Gnutella (described in Section 3). However, other protocols such as those described in [24] may also be used on a super-peer network, resulting in overall performance gain, but similar tradeoffs between configurations...
B. Beverly Yang, et al. Designing a Super-Peer Network
- ...In [29, 11], we investigate simple but efiective improvements over the existing ∞ooding protocol...
- ...Reference [29] presents the Directed BFS technique, which relies on feedback mechanisms to intelligently choose which peer a message should be sent to. Neighbors that have provided quality results in the past will be chosen flrst, yet neighbors with high loads will be passed over, so that good peers do not become overloaded...
- ...Reference [29] also presents the Iterative Deepening technique, which allows search to proceed incrementally until the user is satisfled with the results...
- ...The results of our studies in [29, 11] show that incremental forwarding of query messages and intelligent server selection greatly improves search performance without afiecting quality of results, while [30] shows that an improperly organized network topology and role differentiation can result in high overhead in message forwarding and processing...
Mayank Bawa, et al. Peer-to-peer research at Stanford
- ...In [9], network structure and content distribution in the network are ignored, instead search algorithms are proposed as alternatives to pure broadcast...
Mario Schlosser, et al. HyperCuP - Shaping Up Peer-to-Peer Networks