Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Building efficient and effective metasearch engines
ACM Computing Surveys (CSUR)
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Content-based retrieval in hybrid peer-to-peer networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Distributed search over the hidden web: hierarchical database sampling and selection
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Enhancing P2P file-sharing with an internet-scale query processor
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
A profile-based aggregation model in a peer-to-peer information retrieval system
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
File correspondences dictionary construction in multilingual p2p file sharing systems
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
| Hi-index | 0.00 |
We consider the problem of information retrieval in a peer-to-peer file sharing system. We assume that peers are unreliable, metadata are sparse, and queries are short. In light of this, the question becomes whether there exists a combination of metadata management and ranking techniques that can consistently improve query results. We try several alternatives, and, through analysis and simulation, show a combination that generally yields the best results.