Patent ID: 11960478
Assignee: NEO4J SWEDEN AB
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 9:
10. A method, comprising:
storing a directed acyclic graph comprising, for each of a plurality of database transactions, data identifying the transaction, data indicating one or more prior database transactions on which the database transaction depends, and data indicating whether the transaction has been committed;
determining based on the directed acyclic graph a leading edge comprising a set of committed leaf nodes of the directed acyclic graph, wherein at least one leaf node of the set of committed leaf nodes represents a transaction with respect to a database server, wherein the database server is included in a plurality of database servers each having a resource manager and a coordinator;
providing data representing a respective leading edge from each respective resource manager of each of the plurality of database servers; and
determining to commit a transaction based at least in part on a determination that a majority of the resource managers have indicated they are prepared to commit the transaction and a majority have reported leading edges that are not identical but are compatible.