pSearch
- 1 January 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 33 (1) , 89-94
- https://doi.org/10.1145/774763.774777
Abstract
We describe an efficient peer-to-peer information retrieval system, pSearch; that supports state-of-the-art content- and semantic-based full-text searches. pSearch avoids the scalability problem of existing systems that employ centralized indexing, or index/query flooding. It also avoids the nondeterminism that is exhibited by heuristic-based approaches. In pSearch; documents in the network are organized around their vector representations (based on modern document ranking algorithms) such that the search space for a given query is organized around related documents, achieving both efficiency and accuracy.Keywords
This publication has 5 references indexed in Scilit:
- Probabilistic location and routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Search and replication in unstructured peer-to-peer networksPublished by Association for Computing Machinery (ACM) ,2002
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- GlOSSACM Transactions on Database Systems, 1999
- Matrices, Vector Spaces, and Information RetrievalSIAM Review, 1999