System and method for identifying relationship paths to a target entity

• US 20030187813A1
• Filed: 03/26/2002
• Published: 10/02/2003
• Est. Priority Date: 03/26/2002
• Status: Abandoned Application

• Current Assignee: Capital IQ (Standard & Poor's Investment Advisory Services LLC)
• Original Assignee: Capital IQ (Standard & Poor's Investment Advisory Services LLC)
• Inventors: Goldman, Neal D., Murphy, William
• Application Number:
  US10/107,891
• Publication Number:
  US 20030187813A1
• Time in Patent Office: Days
• US Class Current: 707/1
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

A method of identifying a relationship path from a user or from a start entity to a target entity by establishing a computer platform including an algorithm for determining the shortest path; establishing a central database of combined public and private information comprising a plurality of items of contact information; assigning a unique, relational identifier to each item of contact information in said central database; obtaining at least one client database of contact information comprising a plurality of items of contact information; assigning a unique, relational identifier to each item of contact information in said client database; loading said client database into said central database; integrating said central database with said client database; providing a user interface to said platform for a user to enter start or user entities and a target entity; determining whether relationship paths exist to said target entity; and identifying said relationship paths.

Claims

1. A method of identifying a relationship path to a target entity comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(f) integrating said central database with said client database;

(g) entering a target entity by a user;

(h) determining whether relationship paths exist to said target entity; and

(i) identifying said relationship paths.

2. A method according to claim 1 wherein said user augments said central database with proprietary information.

3. A method according to claim 1 further comprising the step of maintaining said central database.

4. A method according to claim 1 wherein the step of integrating further comprises the step of mapping unique identifiers in said client database to said central database.

5. A method according to claim 1 where the client has the option of either confidentially maintaining its proprietary contact information on its internal Client Relation Management system or using the central database system as its Client Relation Management system.

6. A method according to claim 1 wherein at least part of said client database of contact information remains confidential when loaded into said central database.

8. A method according to claim 1 where more than one relationship path exists, and the shortest relationship path is determined using a shortest path algorithm.

9. A method according to claim 8 where said shortest relationship path is a first degree of separation, resulting in a direct relationship between a user and said target entity.

10. A method according to claim 8 where said shortest relationship path is a second degree of separation, resulting in a user to a second party, and a second party to a target entity relationship.

11. A method according to claim 8 where said shortest relationship path is a third degree of separation, resulting in a user to a second party, a second party to a third party, and a third party to a target entity relationship.

7. A method of identifying a relationship from a user to a target entity via the global computer communication network having a host computer with a front end interface and at least one remote computer comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(f) integrating said central database with said client database;

(g) entering a target entity by said user; and

(h) determining whether a relationship path exists from said user to said target entity; and

(i) identifying said relationship paths.

12. A method of identifying a relationship path from a user to a target entity comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(f) integrating said central database with said client database;

(g) entering a target entity by said user;

(h) determining whether a plurality of relationship paths exist from said user to said target entity;

(i) identifying said plurality of relationship paths;

(j) assigning a score to each of said relationship paths;

(k) determining the shortest relationship path using said score and a shortest path algorithm; and

(l) displaying said relationship paths to user in ranked order based on assigned score.

13. A method according to claim 12 wherein said score is determined by assigning a value to each relationship path depending upon the type of relationship and its degree of separation, with the lowest score indicating the best path.

14. A method according to claim 13 wherein said the scoring system is alphabetical, the lowest score indicated by an “

A.”

15. A method according to claim 14 wherein the step of assigning comprises the steps of:

(a) assigning an “

A”

when said user has a direct relationship with said target entity;

(b) assigning a “

B”

when said user covers said target entity in its course of business;

(c) assigning a “

C”

when a second party has a direct relationship with said target entity; and

(d) assigning a “

D”

when a second party covers the entire course of business of said target entity.

36. A method according to claim 12 where identifying said plurality of relationship paths comprises the steps of:

(a) identifying a first degree of separation when there is a direct relationship between said user and said target entity;

(b) identifying a second degree of separation when there is a relationship resulting in a user to a second party, and a second party to a target entity relationship;

(c) identifying a third degree of separation when there is a relationship resulting in a user to a second party, a second party to a third party, and a third party to a target entity relationship;

(d) identifying a fourth degree of separation when there is a relationship resulting in a user to a second party, a second party to a third party, a third party to a fourth party, and a fourth party to a target entity relationship;

(e) identifying a fifth degree of separation when there is a relationship resulting in a user to a second party, a second party to a third party, a third party to a fourth party, a fourth party to a fifth party, and a fifth party to a target entity relationship; and

(f) identifying a sixth degree of separation when there is a relationship resulting in a user to a second party, a second party to a third party, a third party to a fourth party, a fourth party to a fifth party, a fifth party to a sixth party, and a sixth party to a target entity relationship.

37. A method according to claim 36 wherein relationship paths with infinite degrees of separation are identified.

16. A method of identifying a relationship path from a user to a target entity comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(f) integrating said central database with said client database;

(g) entering a target entity by said user;

(h) determining whether a plurality of relationship paths exists from said user to said target entity;

(i) identifying no relationship path with a first or second degree of separation from said user to said target entity;

(j) identifying at least one relationship path with a third degree of separation from said user to said target entity;

(k) assigning a score to each said relationship path;

(l) determining the shortest relationship path using said score and a shortest path algorithm; and

(m) displaying said relationship paths to user in ranked order based on assigned score.

17. A method according to claim 16 where said third degree of separation relationship results in a user to a second party, a second party to a third party, and a third party to a target entity relationship.

18. A method according to claim 16 wherein said score is determined by assigning a value to each relationship path depending upon the type of relationship, with the lowest score indicating the best path.

19. A method according to claim 16 wherein determining said score comprises the steps of:

(a) determining a first score for each relationship path from said user to the third party;

(b) determining a second score for each relationship path from said third party to said target entity;

(c) adding said first scores with said second scores; and

(d) determining the lowest combined score, which is the best score, and therefore the shortest path using the shortest path algorithm.

20. A method according to claim 19 wherein said scores are determined by assigning a value to each relationship path depending on the type of relationship, with the lowest score indicating the best path.

21. A method according to claim 20 where the scoring system is alphabetical, the lowest score indicated by an “

A.”

22. A method according to claim 21 where determining said first score comprises the steps of:

(a) assigning an “

A”

when said user has a direct relationship with said third party;

(b) assigning a “

B”

when the user covers said third party in its course of business;

(c) assigning a “

C”

when a second party has a direct relationship with said third party; and

(d) assigning a “

D”

when a second party covers the entire course of business of said third party.

23. A method according to claim 21 where determining said second score comprises the steps of:

(a) assigning an “

A”

when the third party is a board member with said target entity;

(b) assigning a “

B”

when the third party works with said target entity;

(c) assigning a “

C”

when the third party covers said target entity;

(d) assigning a “

D”

when the third party works at the company where said target entity is a board member; and

(e) assigning an “

E”

when the third party is a board member at the company where said target entity works.

24. A method of identifying a relationship path from a starting entity to a target entity comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(f) integrating said central database with said client database;

(g) entering a starting entity by a user;

(h) entering a target entity by said user;

(i) determining whether a plurality of relationship paths exist from said starting entity to said target entity;

(j) identifying said plurality of relationship paths;

(k) assigning a score to each of said relationship paths;

(l) determining the shortest relationship path using said score and a shortest path algorithm; and

(m) displaying said relationship paths to user in ranked order based on assigned score.

25. A method according to claim 24 wherein said score is determined by assigning a value to each relationship path depending upon the type of relationship and its degree of separation, with the lowest score indicating the best path.

26. A method according to claim 25 wherein said scoring system is alphabetical, the lowest score indicated by an “

A.”

27. A method according to claim 26 where the step of assigning comprises the steps of:

(a) assigning an “

A”

when said second party has a direct relationship with said target entity;

(b) assigning a “

B”

when said second party covers the entire course of business of said target entity;

(c) assigning a “

C”

when a second party has a direct relationship with said target entity; and

(d) assigning a “

D”

when a second party covers the entire course of business of said target entity.

38. A method according to claim 24 where identifying said plurality of relationship paths comprises the steps of:

(a) identifying a first degree of separation when there is a direct relationship between said starting entity and said target entity;

(b) identifying a second degree of separation when there is a relationship resulting in a starting entity to a second party, and a second party to a target entity relationship;

(c) identifying a third degree of separation when there is a relationship resulting in a starting entity to a second party, a second party to a third party, and a third party to a target entity relationship;

(d) identifying a fourth degree of separation when there is a relationship resulting in a starting entity to a second party, a second party to a third party, a third party to a fourth party, and a fourth party to a target entity relationship;

(e) identifying a fifth degree of separation when there is a relationship resulting in a starting entity to a second party, a second party to a third party, a third party to a fourth party, a fourth party to a fifth party, and a fifth party to a target entity relationship; and

(f) identifying a sixth degree of separation when there is a relationship resulting in a starting entity to a second party, a second party to a third party, a third party to a fourth party, a fourth party to a fifth party, a fifth party to a sixth party, and a sixth party to a target entity relationship.

39. A method according to claim 38 wherein relationship paths with infinite degrees of separation are identified.

28. A method of identifying a relationship path from a starting entity to a target entity comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(f) integrating said central database with said client database;

(g) entering a starting entity by a user;

(h) entering a target entity by said user;

(i) determining whether a plurality of relationship paths exists from said starting entity to said target entity;

(j) identifying no relationship path with a first or second degree of separation from said starting entity to said target entity;

(k) identifying at least one relationship path with a third degree of separation from said starting entity to said target entity;

(l) assigning a score to each said relationship path;

(m) determining the shortest relationship path using said score and a shortest path algorithm; and

(n) displaying said relationship paths to user in ranked order based on assigned score.

29. A method according to claim 28 wherein said third degree of separation relationship results in a person to a second party, a second party to a third party, and a third party to a target entity relationship.

30. A method according to claim 28 wherein said score is determined by assigning a value to each relationship path depending upon the type of relationship, with the lowest score indicating the best path.

31. A method according to claim 28 wherein determining said score comprises the steps of:

(a) determining a first score for each relationship path from said person to the third party;

(b) determining a second score for each relationship path from said third party to said target entity;

(c) adding said first scores with said second scores; and

(d) determining the lowest combined score, which is the best score, and therefore the shortest path using the shortest path algorithm.

32. A method according to claim 31 wherein said scores are determined by assigning a value to each relationship path depending on the type of relationship, with the lowest score indicating the best path.

33. A method according to claim 32 where said scoring system is alphabetical, the lowest score indicated by an “

A.”

34. A method according to claim 33 where determining said first score comprises the steps of

(a) assigning an “

A”

when said person has a direct relationship with said third party;

(b) assigning a “

B”

when said person covers the entire course of business of said third party;

(c) assigning a “

C”

when a second party has a direct relationship with said third party; and

(d) assigning a “

D”

when a second party covers the entire course of business of said third party.

35. A method according to claim 33 where determining said second score comprises the steps of:

(a) assigning an “

A”

when the third party is a board member with said target entity;

(b) assigning a “

B”

when the third party works with said target entity;

(c) assigning a “

C”

when the third party covers said target entity;

(d) assigning a “

D”

when the third party works at the company where said target entity is a board member; and

(e) assigning an “

E”

when the third party is a board member at the company where said target entity works.

40. A method of identifying a relationship path from a starting entity to a target entity comprising the steps of:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) entering a starting entity by a user;

(d) entering a target entity by said user;

(e) determining whether a plurality of relationship paths exist from said starting entity to said target entity;

(f) identifying said plurality of relationship paths;

(g) assigning a score to each of said relationship paths;

(h) determining the shortest relationship path using said score and a shortest path algorithm; and

(i) displaying said relationship paths to user in ranked order based on assigned score.

41. A method of identifying a relationship path from a user or starting entity to a target entity comprising the steps of establishing a computer platform which includes an algorithm for determining the shortest path between a user or starting entity and target entity:

(a) establishing a central database of combined public and private information comprising a plurality of items of contact information;

(b) assigning a unique, relational identifier to each item of contact information in said central database;

(c) obtaining at least one client database of contact information comprising a plurality of items of contact information;

(d) assigning a unique, relational identifier to each item of contact information in said client database;

(e) loading said client database into said central database;

(j) integrating said central database with said client database;

(k) providing a user interface to said platform which allows a user to input the identities of the user or starting entity and the target entity;

(l) determining whether relationship paths exist from said user or starting entity to said target entity; and

(m) identifying said relationship paths.