Contextual access of data

1. A computing device for contextual access, comprising:

a processor; and

memory storing code executable by the processor to implement a traversal of a property graph to collect data for a query, the property graph comprising a plurality of vertices, each vertex associated with information whose access is to be determined by the vertex, the traversal to pass messages pertaining to the query between the vertices of the property graph,

wherein each message comprises a path description to describe a path that the message has traversed through the property graph before arriving at the vertex and a user description to describe a user that issued the query,

wherein to determine whether to grant access to the information associated with the vertex and to outgoing edges of the vertex is based, at least in part, on the path description and the user description, and

wherein upon receiving a message from a previously-traversed neighboring vertex, the vertex to modify the message by amending a regular expression of the message and the path description, the regular expression used to evaluate paths that extend from the path that the message has traversed before arriving at the vertex and the path description modified to reflect paths of outgoing edges, and send a new message comprising the modified message with the amended regular expression and the modified path description to a plurality of neighbor vertices.

2. The computing device of claim 1 , wherein a result of the query comprises an aggregation of results collected by the messages.

3. The computing device of claim 1 , wherein to determine whether to grant access to the information associated with the vertex and to outgoing edges of the vertex is based, at least in part, on:

a permission the user has to access the vertices; and

content the query has collected.

4. The computing device of claim 1 , wherein the property graph models the vertices as independent units of computation that send and receive the messages.

5. The computing device of claim 1 , wherein to determine whether to grant access to the information associated with the vertex and to outgoing edges of the vertex is based, at least in part, on:

an owner of the data represented by the property graph;

data the query has seen; and

a destination of data collected by the query.

6. A computer system for data processing, comprising:

a processor; and

memory storing code executable by the processor to implement a traversal of a property graph to collect data for a query, the property graph comprising a plurality of vertices, each vertex associated with information whose access is to be determined by the vertex, the traversal to pass messages pertaining to the query between the vertices of the property graph,

wherein each message comprises a path description to describe a path that the message has traversed through the property graph before arriving at the vertex and a user description to describe a user that issued the query,

wherein each vertex comprises a first policy checker and second policy checker, the first policy checker providing contextual security at the vertex to determine access to the vertex, and the second policy checker to determine flow of the traversal in the property graph, and the code executable by the processor to implement contextual access to the information associated with the vertex based, at least in part, on the path description and the user description, and

wherein upon receiving a message from a previously-traversed neighboring vertex, the vertex to modify the message by amending a regular expression of the message and the path description, the regular expression used to evaluate paths that extend from the path that the message has traversed before arriving at the vertex and the path description modified to reflect paths of outgoing edges, and send a new message comprising the modified message with the amended regular expression and the modified path description to a plurality of neighbor vertices.

7. The computer system of claim 6 , wherein the contextual access comprises using the path description and the user description to determine via the first policy checker whether to grant access to the vertex and to determine via the second policy checker whether to grant access to an outgoing edge of the vertex.

8. The computer system of claim 6 , wherein the contextual security by the first policy checker for access to the vertex comprises using access tokens for the vertex, the access tokens comprising the path description and the user description, and wherein the second policy checker to determine access to an outgoing edge of the vertex.

9. The computer system of claim 6 , wherein the query comprises input for a recommendation engine in a social media application.

10. The computer system of claim 6 , wherein the contextual security by the first policy checker to determine access to the vertex comprises:

a permission the user has to access the vertex; and

content the query has collected prior to reaching the vertex.

11. The computer system of claim 6 , wherein a message arriving at the vertex comprises a collector address to describe a destination of data collected by the query.

12. The computer system of claim 6 , wherein the contextual security is based on:

an owner of the data represented by the property graph;

data the query has seen prior to reaching the vertex; and

a destination of data collected by the query.

13. A method of data processing, comprising:

implementing, via a computer system, a traversal of a property graph to collect data for a query, the property graph comprising a plurality of vertices, each vertex associated with information whose access is to be determined by the vertex, the traversal to pass messages pertaining to the query between the vertices of the property graph,

wherein each message comprises a path description to describe a path that the message has traversed through the property graph before arriving at the vertex and a user description to describe a user that issued the query,

wherein each vertex comprises a first policy checker and a second policy checker, wherein:

the first policy checker determines access to the vertex; and

the second policy checker determines access to an outgoing edge of the vertex;

implementing, via the computer system, contextual access to the information associated with the vertex based, at least in part, on the path description and the user description, and

wherein upon receiving a message from a previously-traversed neighboring vertex, the vertex to modify the message by amending a regular expression of the message and the path description, the regular expression used to evaluate paths that extend from the path that the message has traversed before arriving at the vertex and the path description modified to reflect paths of outgoing edges, and send a new message comprising the modified message with the amended regular expression and the modified path description to a plurality of neighbor vertices.

14. The method of claim 13 , wherein determining access by the first policy checker comprises to determine access to the vertex by the query based on a permission the user has to access the vertex, and based on information the query has collected prior to reaching the vertex.

15. A tangible, non-transitory, computer-readable medium comprising code executable by a processor to direct the processor to:

implement a traversal of a property graph to collect data for a query, the property graph comprising a plurality of vertices, each vertex associated with information whose access is to be determined by the vertex, the traversal to pass messages pertaining to the query between the vertices of the property graph,

wherein each message comprises a path description to describe a path that the message has traversed through the property graph before arriving at the vertex and a user description to describe a user that issued the query,

wherein each vertex comprises a first policy checker and a second policy checker, wherein:

the first policy checker to determine access to the vertex; and

the second policy checker to determine access to an outgoing edge of the vertex;

implement contextual access to the information associated with the vertex based, at least in part, on the path description and the user description, and

wherein upon receiving a message from a previously-traversed neighboring vertex, the vertex to modify the message by amending a regular expression of the message and the path description, the regular expression used to evaluate paths that extend from the path that the message has traversed before arriving at the vertex, the path description modified to reflect paths of outgoing edges, and send a new message comprising the modified message with the amended regular expression and the modified path description to a plurality of neighbor vertices.

16. The tangible, non-transitory, computer-readable medium of claim 15 , wherein:

a result of the query comprises an aggregation of results collected by the messages.

17. The tangible, non-transitory, computer-readable medium of claim 15 , wherein to determine access by the first policy checker comprises to determine access to the vertex by the query based on a permission the user has to access the vertex, and based on information the query has collected prior to reaching the vertex.

18. The tangible, non-transitory, computer-readable medium of claim 15 , wherein the contextual access is based on:

an owner of the data represented by the property graph;

data the query has seen prior to reaching the vertex; and

a destination of data collected by the query.