Communication networks and methods and computer program products for performing searches thereon while maintaining user privacy

• US 20060106805A1
• Filed: 11/01/2004
• Published: 05/18/2006
• Est. Priority Date: 11/01/2004
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: At&T Delaware Intellectual Property, Inc. (AT&T, Inc.)
• Inventors: Aaron, Jeffrey A.
• Granted Patent: US 7,716,206 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 21/6254 by anonymising data, e.g. decorrelating personal data from the owner's identification

Abstract

A communication network is operated by associating a pseudonym with a user of the communication network at a proxy searcher. A complex search request from the user is received at the proxy searcher, the complex search request being associated with the pseudonym. The complex search request and pseudonym are forwarded from the proxy searcher to a central searcher. The complex search request is divided into a plurality of simple search requests at the central searcher. The plurality of simple search requests are performed on at least one database. The results of the plurality of simple search requests are provided to the proxy searcher, the results being associated with the pseudonym.

Claims

1. A method of operating a communication network, comprising:

associating a pseudonym with a user of the communication network at a proxy searcher;

receiving a complex search request from the user at the proxy searcher, the complex search request being associated with the pseudonym;

forwarding the complex search request and pseudonym from the proxy searcher to a central searcher;

dividing the complex search request into a plurality of simple search requests at the central searcher;

performing the plurality of simple search requests on at least one database; and

providing results of the plurality of simple search requests to the proxy searcher, the results being associated with the pseudonym.

2. The method of claim 1, wherein associating the pseudonym comprises:

hashing identification information of the user to generate the pseudonym.

3. The method of claim 2, wherein hashing identification information comprises:

hashing identification information of the user with salt data to generate the pseudonym.

4. The method of claim 1, wherein the complex search request comprises a complex search request matrix, the complex search request matrix comprising:

a first matrix dimension corresponding to general search categories; and

a second matrix dimension corresponding to sub-categories of the general search categories.

5. The method of claim 4, wherein performing the plurality of simple search requests comprises:

performing searches on the at least one database for non-null entries in the complex search request matrix.

6. The method of claim 5, further comprising:

providing rules for evaluating whether a search result satisfies respective simple search requests corresponding to non-null entries in the complex search request matrix.

7. The method of claim 6, wherein providing results of the plurality of simple search requests comprises:

applying the rules to results of the searches on the at least one database for each non-null entry in the complex search request matrix so as to generate a results matrix having respective result indicators corresponding to each cell of the complex search matrix; and

wherein the result indicators comprises a binary indicator and/or a numerical indicator having a specified range of values indicating a degree to which a search result satisfied the search request.

8. The method of claim 4, further comprising:

tracking results from each of the at least one database by category and/or sub-category; and

determining which of the at least one database provides satisfactory results for the respective categories and/or sub-categories.

9. The method of claim 8, wherein tracking results from each of the at least one database comprises:

tracking a number of satisfactory results in a given time period;

tracking a number of satisfactory results in a set of time periods;

tracking a weighted number of satisfactory results in a set of time periods;

tracking a rate of change of satisfactory results in a given time period;

tracking a rate of change of satisfactory results in a set of time periods;

tracking a weighted rate of change of satisfactory results in a set of time periods.

10. A communication network, comprising:

a central searcher;

a pseudonym server that is configured to associate a pseudonym with a user of the communication network; and

a proxy server that is connected to the pseudonym server and the central searcher, the proxy server being configured to receive a complex search request from the user and to forward the complex search request and pseudonym to the central searcher;

wherein the central searcher is configured to divide the complex search request into a plurality of simple search requests, to perform the plurality of search requests on at least one database, and to provide results of the plurality of simple search requests to the proxy searcher such that the results are associated with the pseudonym.

11. The communication network of claim 10, wherein the pseudonym server is further configured to hash identification information of the user to generate the pseudonym.

12. The communication network of claim 11, wherein the pseudonym server is further configured to hash identification information of the user with salt data to generate the pseudonym.

13. The communication network of claim 10, wherein the complex search request comprises a complex search request matrix, the complex search request matrix comprising:

a first matrix dimension corresponding to general search categories; and

a second matrix dimension corresponding to sub-categories of the general search categories.

14. The communication network of claim 13, wherein the central searcher is further configured to perform searches on the at least one database for non-null entries in the complex search request matrix.

15. The communication network of claim 14, wherein the proxy searcher is further configured to provide rules for evaluating whether a search result satisfies respective simple search requests corresponding to non-null entries in the complex search request matrix.

16. The communication network of claim 13, wherein the proxy searcher is configured to track results from each of the at least one database by category and/or sub-category, and to determine which of the at least one database provides satisfactory results for the respective categories and/or sub-categories.

17. A computer program product for operating a communication network, comprising:

a computer readable storage medium having computer readable program code embodied therein, the computer readable program code comprising;

computer readable program code configured to associate a pseudonym with a user of the communication network at a proxy searcher;

computer readable program code configured to receive a complex search request from the user at the proxy searcher, the complex search request being associated with the pseudonym;

computer readable program code configured to forward the complex search request and pseudonym from the proxy searcher to a central searcher;

computer readable program code configured to divide the complex search request into a plurality of simple search requests at the central searcher;

computer readable program code configured to perform the plurality of simple search requests on at least one database; and

computer readable program code configured to provide results of the plurality of simple search requests to the proxy searcher, the results being associated with the pseudonym.

18. The computer program product of claim 17, wherein the complex search request comprises a complex search request matrix, the complex search request matrix comprising:

a first matrix dimension corresponding to general search categories; and

a second matrix dimension corresponding to sub-categories of the general search categories;

the computer program product further comprising;

computer readable program code configured to perform a search on the at least one database for each non-null entry in the complex search request matrix.

19. The computer program product of claim 18, further comprising:

computer readable program code configured to provide rules for evaluating whether a search result satisfies respective simple search requests corresponding to non-null entries in the complex search request matrix.

20. The computer program product of claim 18, further comprising:

computer readable program code configured to track results from each of the at least one database by category and/or sub-category; and

computer readable program code configured to determine which of the at least one database provides satisfactory results for the respective categories and/or sub-categories.