A Keyword-Set investigate System for Peer-to-Peer Networks
DOI:
https://doi.org/10.61841/4nrnvm30Keywords:
Peer-to-Peer, KSS,, Napster, ,networkAbstract
The Keyword-Set Search System (KSS) is a Peer-to-Peer (P2P) keyword look for sys-tend that uses a circulated wrong side up index. The main challenge in a distributed index and search system is sentence the right proposal to partition the index across the nodes in the network. The most understandable scheme would be to partition the index by keyword. A keyword partition index requires that the list of index entries for each keyword in a search be retrieved, so all the lists can be joined; only a few nodes need to be contact, but each sends a potentially great amount of information, The document list for each set of keywords is then fetched from the network. The lists are intersected to compute the list of similar documents. The list of index entry for each set of words is smaller than the list of entrance for each word. Thus look for using KSS results in a slighter query time over head.
Downloads
References
[1] E. Adar and B. Huberman. Free riding on gnutella, 2000.
[2] Anurag Singla and Christopher Rohrs. Ultrapeers: Another Step Towards Gnutella Scalability, December 2001.
[3] Christopher Rohrs. Query Routing for the Gnutella Network, December 2001. http://rfc- gnutella.sourceforge.net/Proposals/QRP/query routing.htm.
[4] Arturo Crespo and Hector Garcia-Molina. Routing indices for peer-to-peer systems. Technical Report 2001-48, Stanford University, CS Department, November 2001.
[5] Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP ’01), Chateau Lake Louise, Banff, Canada, October 2001.
[6] FastTrack. http://www.fasttrack.nu/. [7] FreeDB. http://www.freedb.org/. [8] Gnutella. http://gnutella.wego.com/.
[9] Gordon Mohr. Hash/URN Gnutella Extensions (HUGE) v0.92, October 2001.
[10] Grokster. http://www.grokster.com/.
[11] Jordan Ritter. Why Gnutella Can’t Scale. No, Really. http://www.darkridge.com/ jpr5/gnutella.html
[12] D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654–663, El Paso, TX, May 1997.
[13] Kazaa. http://www.kazaa.com/.
[14] L F Mackert and G M Lohman. R* optimizer validation and performance evaluation for distributed queries. In Proceedings of the 12th International Conference on Very Large Data Bases, pages 149–159, Kyoto, Japan, 1986.
[15] Mark A. Sheldon and Andrzej Duda and Ron Weiss and David K. Gifford. Discover: a resource discovery system based on content routing. Computer Networks and ISDN Systems, 27(6):953–972, 1995.
[16] James K Mullin. Optimal semijoins for distributed database systems. In IEEE Transactions on Software Engineering, pages 558–560, May 1990.
[17] Napster. http://www.napster.com/.
[18] Scott Shenker Qin Lv, Sylvia Ratnasamy. Can heterogeneity make gnutella scalable? In First International Workshop on Peer-to-Peer Systems (IPTPS) 2002, Cambridge, MA, March 2002.
[19] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. In Proceedings of SIGCOMM 2001, San Diego, August 2001.
[20] Patrick Reynolds and Amin Vahdat. Efficient peer-to-peer keyword searching. Technical Report 2002, Duke University, CS Department, February 2002.
[21] Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A measurement study of peer- to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN ’02), San Jose.
22] Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM ’01 Conference, San Diego, California, August 2001.
[23] Sumeet Thadani. Meta Information Searches on the Gnutella Network, 2001. http://rfcgnutella.sourceforge.net/Proposals/MetaData/meta information searches.htm.
[24] Steve Waterhouse. Jxta search: Distributed search for distributed networks. http://search.jxta.org/JXTAsearch.pdf.
[25] Beverly Yang and Hector Garcia-Molina. Efficient search in peer-to-peer networks. Technical Report 2001-47, Stanford University, CS Department, November 2001.
[26] Ben Zhao, John Kubiatowicz, and Anthony Joseph. Tapestry: An infrastructure for fault- tolerant wide-area locat ion and routing. Technical Report UCB/CSD01-1141, Computer Science Division, U. C. Berkeley
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
