Routing indices for peer-to-peer systems

By Arturo Crespo, Hector Garcia-Molina. Proceedings 22nd International Conference on Distributed Computing Systems, 2002

900 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/424735cb4e37bceba4aa23d07a8a2093de57f44a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Search and replication in unstructured peer-to-peer networks (2002, background): “[9] also studies ways to provide hints by building routing indices.”
Efficient search in peer to peer networks (2004, methodology): “Keywords: Peer-to-peer, distributed data, search, performance modeling, evaluation Technical Area(s): Databases, performance modeling and evaluation”
Semantic Overlay Networks for P2P Systems (2004, background): “The decision of to which neighbors a query can be forwarded can be done by using local indices [26], routing indices [2], or by simply sending the query to all of neighbors (as Gnutella does).”
Adaptive probabilistic search for peer-to-peer networks (2003, background): “In [ CGM02 ], nodes store file content metadata for each of their outgoing links, enabling them to forward a query to the neighbor with the highest value of a defined metric.”
Improving search in peer-to-peer networks (2002, background): “Other search techniques for “loose” systems include [1], [ 3 ] and [10].”
TinyDB: an acquisitional query processing system for sensor networks (2005, background): “There is also some similarity to indexing in peer-to-peer systems [Crespo and Garcia-Molina 2002].”
Caching in information centric networking: A survey (2013, background): “, Routing Indices (RIs) [21] and Freenet [19].”
A local search mechanism for peer-to-peer networks (2002, methodology): “Typically the user speci.es the name of the .le he/she is looking for and searches for the .le using a brute force mechanism, as we described in the previous section.”
Designing a super-peer network (2003, background): “…on improving search efﬁciency by designing good search protocols; for example, Chord [20], Pastry [17], CAN [16], and Tapestry [24] in the speciﬁc context of supporting point queries, and [4, 23] in the context of supporting more expressive queries (e.g., keyword query with regular expressions).”
Peer-to-peer information retrieval using self-organizing semantic overlay networks (2003, methodology): “Although a number of P2P search techniques [16, 3, 20, 5 , 22, 10] have already been proposed in recent years, with very few exceptions [6], most of them are based on simple keyword matching, ignoring advanced relevance ranking algorithms devised by the IR community through decades of refinement an”
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks (2003, background): “The introduction of super-peers in combination with routing indices reduces the workload of peers significantly by distributing queries only to the appropriate subset of all possible peers (see also [6] who discusses routing indices based on various aggregation strategies of content indices).”