Peer-to-peer file sharing

• US 7,860,876 B2
• Filed: 06/09/2006
• Issued: 12/28/2010
• Est. Priority Date: 06/09/2006
• Status: Active Grant

• Current Assignee: Illinois Institute of Technology
• Original Assignee: Illinois Institute of Technology
• Inventors: Yee, Wai Gen, Frieder, Ophir
• Primary Examiner(s): Wassum; Luke S.
• Assistant Examiner(s): Allen; Nicholas E
• Application Number:
  US11/450,776
• Publication Number:
  US 20070288446A1
• Time in Patent Office: 1,663 Days
• Field of Search: None
• US Class Current: 707/759
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: Y10S 707/967 Peer-to-peer

Abstract

A peer-to-peer (P2P) file sharing system is provided with an enhanced search method for a client computer therein. The method includes masking at least one term in a multi-term query entered into a client computer of the P2P system to obtain a masked query and routing the masked query to a plurality of server computers. The masked query is compared to a file descriptor of server files in each of the plurality of server computers to identify a plurality of matching server files. The server computers return to the client computer as search results the file descriptor and a mathematical identifier for each of the plurality of matching server files. The server computer may return to the client computer only a subset of the plurality of the matching server files. Enhanced P2P file searching accuracy is provided.

Claims

1. A method for implementing a search in a peer-to-peer (P2P) file sharing system, the method comprising:

masking a term in a query entered into a client computer of the P2P system to obtain a masked query, wherein the term is not a stop word and masking the term in the query to obtain a masked query includes the client computer automatically removing the term from the query;

routing the masked query from the client computer to a plurality of server computers within the P2P system;

searching each of the plurality of server computers using the masked query by comparing each query term of the masked query to a file descriptor of at least one server file in each of the plurality of server computers; and

returning search results to the client computer, wherein each of the search results is a matching server file from one of the plurality of server computers having a matching file descriptor including query terms of the masked query.

2. The method according to claim 1, wherein the term in the query automatically removed by the client computer is selected from a group consisting of a term that appears least frequently in at least one of the query and local descriptors, a term that appears most frequently in at least one of the query and the local descriptors, or a randomly selected term.

3. The method according to claim 1, wherein each of the search results comprises the matching file descriptor and a mathematical identifier for each of a plurality of matching server files.

4. The method according to claim 1, wherein the query comprises a conjunctive query, and the term that is masked is not a conjunction.

5. The method according to claim 1, additionally comprising displaying the search results in a human perceivable form.

6. The method according to claim 1, wherein searching the plurality of server computers comprises matching terms of the masked query to terms of a file descriptor in each of the plurality of server computers.

7. The method according to claim 6, wherein software on each of the plurality of server computers matches the terms of the masked query to terms of the file descriptor.

8. The method according to claim 6, wherein the file descriptor matches the masked query when the file descriptor contains all terms of the masked query.

9. The method according to claim 1, additionally comprising ranking the search results compared to the query entered into the client computer.

10. The method according to claim 1, wherein each of the search results comprises at least one of a file descriptor, a mathematical identifier, and a server computer identifier, and additionally comprising:

grouping each of the search results into one of a plurality of groups as a function of the file descriptor or the mathematical identifier.

11. The method according to claim 10, additionally comprising ranking the plurality of groups according to a ranking metric.

12. The method according to claim 1, wherein the term masked by the client computer is not searched in any server computer of the P2P file sharing system.

13. A method for implementing a search in a peer-to-peer (P2P) file sharing system, the method comprising:

receiving a query from a user into a client computer of the P2P system, the query including more than one searchable term, each of the more than one searchable term being searchable by the P2P file sharing system within a plurality of server computers of the P2P file sharing system;

masking at least one of the more than one searchable term in the query to obtain a masked query using software executed on the client computer;

routing the masked query from the client computer to each of the plurality of server computers within the P2P system;

searching the each of the plurality of server computers using the masked query by comparing each query term of the masked query to a file descriptor of at least one server file in each of the plurality of server computers to identify a plurality of matching server files each having a matching file descriptor including each query term of the masked query;

returning to the client computer as search results the file descriptor and a mathematical identifier for each of the plurality of matching server files;

grouping each of the search results into one of a plurality of groups as a function of the mathematical identifier; and

ranking the plurality of groups.

14. The method of claim 13, wherein the mathematical identifier comprises a hash key.

15. The method according to claim 13, wherein the masked searchable term in the query is selected from a group consisting of a term that appears least frequently in at least one of the query and local descriptors, a term that appears most frequently in at least one of the query and the local descriptors, or a randomly selected term.

16. The method according to claim 13, wherein the file descriptor matches the masked query when the file descriptor contains all terms of the masked query.

17. The method according to claim 13, wherein the client computer ranks the plurality of groups compared to the query entered into the client computer.

18. The method according to claim 17, wherein the client computer ranks the plurality of groups according to a ranking metric selected from group size, term frequency, term precision, or cosine similarity.

19. The method according to claim 13, further comprising removing any common term from the query that is not a searchable term according to the peer-to-peer (P2P) file sharing system.

20. A method for implementing a search in a peer-to-peer (P2P) file sharing system, the method comprising:

masking a term in a query entered by a user into a client computer of the P2P system to obtain a masked query, wherein the term in the query that is masked is one of a searchable term that appears least frequently in at least one of the query and local descriptors, a searchable term that appears most frequently in at least one of the query and the local descriptors, or a randomly selected searchable term;

searching a plurality of server computers of the P2P system using the masked query by comparing each query term of the masked query to a file descriptor of at least one server file in each of the plurality of server computers; and

returning as search results to the client computer matching server files from the plurality of server computers having a file descriptor including all query terms of the masked query.