Google Inc.

Ben Hutchinson

Amit Behal

Keith Patrick Golden

William Young Chang

Yuan Gao

Faen Zhang

Fei Wu

Alexander Oliver Marks

A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Real-time saved-query updates for a large graph

A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, that a collapsed definition for a first query that includes the constraint indicates a member node is responsive to the first query. The system may then update a saved query result for the first query using the member node identified during the traversal in accordance with the collapsed definition.

A system for automatically generating entity collections comprises a data graph including entities connected by edges and instructions that cause the computer system to determine a set of entities from the data graph and to determine a set of constraints that has a quantity of constraints. A constraint in the set represents a path in the data graph shared by at least two of the entities in the set of entities. The instructions also cause the computer system to generate candidate collection definitions from combinations of the constraints, where each candidate collection definition identifies at least one constraint and no more than the quantity of constraints. The instructions also cause the computer system to determine an information gain for at least some of the candidate collection definitions, and store at least one candidate collection definition that has an information gain that meets a threshold as a candidate collection.

Growing community of inventors

San Francisco, CA, United States of America

Ben Hutchinson