Method and Apparatus for Restricting a Fan-Out Search in a Peer-to-Peer Network Based on Accessibility of Nodes

• US 20090063476A1
• Filed: 10/02/2008
• Published: 03/05/2009
• Est. Priority Date: 09/13/2001
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dutta, Rabindranath, French, Steven Michael, Janakiraman, Janani
• Granted Patent: US 8,250,063 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: G06F 16/24524 Access plan code generation and invalidation; Reuse of access plans
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/10015 Access to distributed or replicated servers, e.g. using brokers
• CPC Class Codes: H04L 67/563 Data redirection of data network streams
• CPC Class Codes: H04L 67/565 Conversion or adaptation of application format or content adding application control or application functional data H04L67/561
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: Y10S 707/967 Peer-to-peer
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access

Abstract

A method, apparatus, and computer implemented instructions for restricting a fan-out type search of a distributed database. A search request is received indicating that a requesting node originating the search request desires to avoid receiving search results including inaccessible nodes. Responsive to receiving the search results from other nodes, the search results are filtered to remove search results from inaccessible nodes to form filtered search results. The filtered search results are passed to the requesting node.

Claims

1-7. -7. (canceled)

8. A method in a data processing system for processing search requests in a peer-to-peer network, the method comprising:

responsive to an originating node generating a search request for a fan-out search sending the search request to a set of peer nodes, wherein a respective peer node in the set of peer nodes forwards the search request to other peer nodes in the set of peer nodes; and

receiving search results, wherein the search results comprises an identification of whether a given peer node containing data corresponding to the search request is an inaccessible node, and wherein the data corresponding to the search request is pulled from accessible nodes identified in the search results.

9. The method of claim 8, wherein the peer-to-peer network is located in at least one of an Internet, an intranet, a wide area network, and a local network.

10. The method of claim 8 further comprising:

selectively pulling the data corresponding to the search from accessible nodes identified in the search results.

11. The method of claim 8 further comprising:

selectively allowing the data corresponding to the search request to be pushed to the data processing system from an inaccessible node identified in the search results.

12. The method of claim 8, wherein the inaccessible node is a node behind a firewall.

13-20. -20. (canceled)

21. A data processing system for processing search requests in a peer-to-peer network, the data processing system comprising:

sending means for sending the search request to a set of peer nodes in response to an originating node generating a search request for a fan out search, wherein a respective peer node in the set of peer nodes forwards the search request to other peer nodes in the set of peer nodes; and

receiving means for receiving search results, wherein the search results comprises an identification of whether a given peer node containing data corresponding to the search request is an inaccessible node, and wherein the data corresponding to the search request is pulled from accessible nodes identified in the search results.

22. The data processing system of claim 21, wherein the peer-to-peer network is located in at least one of an Internet, an intranet, a wide area network, and a local network.

23. The data processing system of claim 21 further comprising:

pulling means for selectively pulling the data corresponding to the search from accessible nodes identified in the search results.

24. The data processing system of claim 21 further comprising:

allowing means for selectively allowing the data corresponding to the search request to be pushed to the data processing system from an inaccessible node identified in the search results.

25. The data processing system of claim 21, wherein the inaccessible node is a node behind a firewall.

26. A data processing system for processing search requests in a peer-to-peer network, the data processing system comprising:

first receiving means for receiving a search request from an originating node;

sending means for sending the search request to a set of nodes identified by the data processing system, wherein a respective peer node in the set of peer nodes forwards the search request to other peer nodes in the set of peer nodes; and

second receiving means for receiving results from the set of nodes, wherein the results identify whether a node within the set of nodes is an inaccessible node, and wherein the data corresponding to the search request is pulled from accessible nodes identified in the search results.

27-28. -28. (canceled)

29. A computer program product in a computer readable medium for processing search requests in a peer-to-peer network, the computer program product comprising:

first instructions for receiving a search request from an originating node;

second instructions for sending the search request to a set of nodes identified by the data processing system, wherein a respective peer node in the set of peer nodes forwards the search request to other peer nodes in the set of peer nodes; and

third instructions for receiving results from the set of nodes, wherein the results identify whether a node within the set of nodes is an inaccessible node, and wherein the data corresponding to the search request is pulled from accessible nodes identified in the search results.

30-32. -32. (canceled)