Composite term index for graph data
First Claim
Patent Images
1. A method comprising, by one or more index servers of an online social network:
- receiving, from a client server of the online social network, a search query comprising an first edge-type term and a first object identifier;
accessing, at the one or more index servers, one or more indexes associated with the online social network, each index comprising one or more data objects, the data objects comprising;
one or more node objects; and
one or more edge objects;
identifying a first set of edge objects having an edge type specified by the first edge-type term and having a destination node corresponding to the first object identifier of the search query;
identifying a second set of node objects that are source nodes of the first set of edge objects; and
sending, to the client server, object identifiers of one or more node objects of the second set.
1 Assignment
0 Petitions
Accused Products
Abstract
This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.
-
Citations
18 Claims
-
1. A method comprising, by one or more index servers of an online social network:
-
receiving, from a client server of the online social network, a search query comprising an first edge-type term and a first object identifier; accessing, at the one or more index servers, one or more indexes associated with the online social network, each index comprising one or more data objects, the data objects comprising; one or more node objects; and one or more edge objects; identifying a first set of edge objects having an edge type specified by the first edge-type term and having a destination node corresponding to the first object identifier of the search query; identifying a second set of node objects that are source nodes of the first set of edge objects; and sending, to the client server, object identifiers of one or more node objects of the second set. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
-
receive, from a client server of an online social network, a search query comprising an edge-type term and an object identifier, and the online social network comprising one or more index servers; access, at the one or more index servers, one or more indexes associated with the online social network, each index comprising one or more data objects, the data objects comprising; one or more node objects; and one or more edge objects; identify a first set of edge objects having an edge type specified by the edge-type term and having a destination node corresponding to the object identifier of the search query; identify a second set of node objects that are source nodes of the first set of edge objects; and send, to the client server, object identifiers of one or more node objects of the second set.
-
-
18. A system comprising:
- one or more processors; and
a non-transitory memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;receive, from a client server of an online social network, a search query comprising an edge-type term and an object identifier, and the online social network comprising one or more index servers; access, at the one or more index servers, one or more indexes associated with the online social network, each index comprising one or more data objects, the data objects comprising; one or more node objects; and one or more edge objects; identify a first set of edge objects having an edge type specified by the edge-type term and having a destination node corresponding to the object identifier of the search query; identify a second set of node objects that are source nodes of the first set of edge objects; and send, to the client server, object identifiers of one or more node objects of the second set.
- one or more processors; and
Specification