Patent · US Active

Resolving conflicting graph mutations

US8645429B1 · kind B1 · utility

31Cited by

3References

15Claims

0Family size

Assignee

Google LLC · US

Inventors

Aart J. C. Bik · Union City, US
Matthew H. Austern · Palo Alto, US
James C. Dehnert · Palo Alto, US
Grzegorz Czajkowski · Menlo Park, US
Grzegorz Malewicz · Menlo Park, US
Naty Leiser · Haifa, IL

Key dates

Filing date	Mar 28, 2012
Grant date	Feb 4, 2014
Priority date	—
Expiry date	Mar 28, 2032

Classification

Technology area (CPC G)Physics
CPC primaryG06F16/27
WIPO fieldComputer technology
WIPO sectorElectrical engineering

Abstract

Resolving conflicting graph mutations in a distributed computing system. Graph data for at least a partition of a graph is stored in a worker system of a distributed computing system. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. A plurality of conflicting mutation requests are received to mutate the graph. A conflict between the mutation requests is resolved with a conflict resolution function that lacks direct access to the graph data. The graph data is updated responsive to a result generated by resolving the conflict using the conflict resolution function.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.