DETERMINATION OF PATHS BETWEEN ENTITIES IN A MULTI-RELATIONSHIP SOCIAL NETWORK

• US 20100100494A1
• Filed: 10/17/2008
• Published: 04/22/2010
• Est. Priority Date: 10/17/2008
• Status: Abandoned Application

• Current Assignee: SAP France SA (SAP SE)
• Original Assignee: SAP France SA (SAP SE)
• Inventors: Polo-Malouvier, Ricardo, Marinoiu, Bogdan
• Application Number:
  US12/253,614
• Publication Number:
  US 20100100494A1
• Time in Patent Office: Days
• US Class Current: 705/319
• CPC Class Codes: G06Q 10/00 Administration; Management
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

Some aspects include determination of a source entity and a target entity from a plurality of entities, wherein a first one of the plurality of entities is associated with a second one of the plurality of entities by a first type of social relationship and a third one of the plurality of entities is associated with a fourth one of the plurality of entities by a second type of social relationship, and determination of a shortest path through the plurality of entities from the source entity to the target entity.

Claims

1. A method comprising:

determining a source entity and a target entity from a plurality of entities, wherein a first one of the plurality of entities is associated with a second one of the plurality of entities by a first type of social relationship and a third one of the plurality of entities is associated with a fourth one of the plurality of entities by a second type of social relationship; and

determining a shortest path through the plurality of entities from the source entity to the target entity.

2. A method according to claim 1,

wherein each of the plurality of entities is a person.

3. A method according to claim 2, wherein the first type of social relationship is a supervisory relationship and the second type of social relationship is a contact relationship.

4. A method according to claim 1, further comprising:

determining a maximum path length,

wherein determining the shortest path comprises determining that no path through the plurality of entities from the source entity to the target entity is associated with a length equal to or less than the maximum path length.

5. A method according to claim 1, wherein determining the shortest path comprises:

identifying a first set of the plurality of entities, each entity of the first set being associated with the source entity by at least one social relationship;

identifying a second set of the plurality of entities, each entity of the second set being associated with at least one of the entities of the first set by at least one social relationship; and

identifying a third set of the plurality of entities, each entity of the third set being associated with the target entity by at least one social relationship.

6. A method according to claim 1, wherein determining the shortest path comprises:

determining a plurality of paths through the plurality of entities from the source entity to the target entity, each of the plurality of paths comprising a respective set of entities; and

determining the shortest path of the plurality of paths based on weightings of social relationships between the entities of each respective set of entities.

7. A computer-readable medium having stored thereon program code, the program code executable by a computer to:

determine a source entity and a target entity from a plurality of entities, wherein a first one of the plurality of entities is associated with a second one of the plurality of entities by a first type of social relationship and a third one of the plurality of entities is associated with a fourth one of the plurality of entities by a second type of social relationship; and

determine a shortest path through the plurality of entities from the source entity to the target entity.

8. A medium according to claim 7,

wherein each of the plurality of entities is a person.

9. A medium according to claim 8, wherein the first type of social relationship is a supervisory relationship and the second type of social relationship is a contact relationship.

10. A medium according to claim 7, the program code further executable by a computer to:

determine a maximum path length,

wherein determination of the shortest path comprises determination that no path through the plurality of entities from the source entity to the target entity is associated with a length equal to or less than the maximum path length.

11. A medium according to claim 7, wherein determination of the shortest path comprises:

identification of a first set of the plurality of entities, each entity of the first set being associated with the source entity by at least one social relationship;

identification of a second set of the plurality of entities, each entity of the second set being associated with at least one of the entities of the first set by at least one social relationship; and

identification of a third set of the plurality of entities, each entity of the third set being associated with the target entity by at least one social relationship.

12. A medium according to claim 7, wherein determination of the shortest path comprises:

determination of a plurality of paths through the plurality of entities from the source entity to the target entity, each of the plurality of paths comprising a respective set of entities; and

determination of the shortest path of the plurality of paths based on weightings of social relationships between the entities of each respective set of entities.

13. A system comprising:

a data repository associating a first one of a plurality of entities with a second one of the plurality of entities by a first type of social relationship and associating a third one of the plurality of entities with a fourth one of the plurality of entities by a second type of social relationship; and

a database procedure to determine a shortest path through the plurality of entities from a source entity of the plurality of entities to a target entity of the plurality of entities.

14. A system according to claim 13,

wherein each of the plurality of entities is a person.

15. A system according to claim 14, wherein the first type of social relationship is a supervisory relationship and the second type of social relationship is a contact relationship.

16. A system according to claim 13, the database procedure further to:

determine a maximum path length,

wherein determination of the shortest path comprises determination that no path through the plurality of entities from the source entity to the target entity is associated with a length equal to or less than the maximum path length.

17. A system according to claim 13, wherein determination of the shortest path comprises:

identification of a first set of the plurality of entities, each entity of the first set being associated with the source entity by at least one social relationship;

identification of a second set of the plurality of entities, each entity of the second set being associated with at least one of the entities of the first set by at least one social relationship; and

identification of a third set of the plurality of entities, each entity of the third set being associated with the target entity by at least one social relationship.

18. A system according to claim 13, wherein determination of the shortest path comprises:

determination of a plurality of paths through the plurality of entities from the source entity to the target entity, each of the plurality of paths comprising a respective set of entities; and

determination of the shortest path of the plurality of paths based on weightings of social relationships between the entities of each respective set of entities.