Using an ontology model to validate connectivity in a social graph

1. A method comprising:

gathering unfiltered information on a first entity represented by a first system-provided node, wherein the first system-provided node exists in a social graph with a plurality of system-provided nodes and a plurality of system-provided edges connecting system-provided nodes;

storing in a database with a first database identifier the unfiltered information, wherein the database and the social graph are stored separately and the first database identifier is unique in the database;

selecting a first complex entity of the social graph, wherein the first complex entity is associated with the unfiltered information and the first complex entity is connected to at least two other system-provided nodes representing a second relationship type and a third relationship type;

determining a first relationship type and a first entity type of the first entity based on the unfiltered information;

retrieving from a validation table a first list of acceptable entity types based on the first relationship type;

determining in a memory of a computer the first entity type is valid when the first entity type is in the first list;

if the first entity type is valid, storing a first edge in the social graph with a first graph identifier, wherein the first edge connects the first system-provided node with the first complex entity, the first graph identifier maps in the database solely to the first database identifier, and the first graph identifier is unique in the social graph; and

if the first entity type is invalid, replacing the first entity type with a second entity type.

2. The method of claim 1 wherein the first and second relationship types are a single relationship type.

3. The method of claim 1 wherein the first and second relationship types are different relationship types.

4. The method of claim 1 wherein the second and third relationship types are different.

5. The method of claim 1 wherein the retrieving from a validation table a first list of acceptable entity types based on the first relationship type further comprises the first list is associated with the first complex entity.

6. The method of claim 1 wherein the first entity is a person.

7. The method of claim 1 wherein the first entity is an organization, wherein an organization comprises at least two persons.

8. The method of claim 1 wherein the validation table is stored separately from the social graph.

9. The method of claim 1 wherein the first complex entity has a second edge connecting second entity representing a time.

10. The method of claim 1 wherein the first complex entity has a second edge connecting second entity that represents a time series, wherein there are at least two elements of the time series and each element of the time series represents a time.

11. The method of claim 1 wherein the first complex entity has a second edge representing a location.

12. The method of claim 1 further comprising:

providing to a user a result based on the connection of the first system-provided node to one of the at least two system-provided nodes connected to the first complex entity.

13. The method of claim 12 wherein the providing to a user a result is without accessing the database.

14. The method of claim 1 further comprising:

providing to a user a summary based on the connections of the at least two system-provided nodes connected to the first complex entity, wherein the summary includes the at least two system-provided nodes connected to the first complex entity.

15. The method of claim 14 wherein the summary excludes the first complex entity.

16. The method of claim 15 wherein the gathering unfiltered information comprising:

accepting a first piece of information from the unfiltered information;

accepting a second piece of information from the unfiltered information; and

ignoring a third piece of information from the unfiltered information.

17. A method comprising:

gathering unfiltered information on a first entity represented by a first system-provided node, wherein the first system-provided node exists in a social graph with a plurality of system-provided nodes and a plurality of system-provided edges connecting system-provided nodes;

storing in a database the unfiltered information, wherein the database and the social graph are stored separately;

extracting a first and a second connection from the unfiltered information, wherein the first connection is between a second system-provided node and the first system-provided node, the second connection is between a third system-provided node and the first system-provided node, and the second and third system-provided nodes are different;

determining a first relationship type and a first entity type of the first connection based on the unfiltered information;

retrieving from a validation table a first list of acceptable entity types based on the first connection;

determining a second relationship type and a second entity type of the second connection based on the unfiltered information;

retrieving from the validation table a second list of acceptable entity types based on the second connection;

determining in a memory of a computer if the first and second entity types are valid when the first entity type is in the first list and the second entity type is in the second list; and

if the first and second entity types are valid, storing a first and a second edges in the social graph, wherein the first edge connects the first system-provided node with the second system-provided node, and the second edge connects the first system-provided node with the third system-provided node.

18. The method of claim 17 wherein the first and second relationship types are different.

19. The method of claim 17 wherein the first and second lists are different.

20. The method of claim 17 wherein the first and second lists are identical.