Neo4j Sweden Ab

Neo Technology, Inc.

Mats Tobias Lindaaker

James Webber

Alistair Philip Campbell Jones

Ian S Robinson

A database system with a transactional commit protocol based on a safe conjunction of majorities is disclosed. In various embodiments, a directed acyclic graph comprises, for each of a plurality of transactions, data identifying the transaction, data indicating prior transaction(s) on which the transaction depends, and data indicating whether the transaction has been committed. A processor associated with a resource manager of a first database server included in a plurality of database servers each having a resource manager, determines a leading edge comprising a set of committed leaf nodes of the directed acyclic graph. The processor provides data representing a respective leading edge from each respective resource manager, and determines to commit a transaction based on a determination that a majority of the resource managers have indicated they agree on a consistent starting state and ending state for the transaction.

Database system with transactional commit protocol based on safe conjunction of majorities

A database system with a transactional commit protocol based on a safe conjunction of majorities is disclosed. In various embodiments, 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 is stored. A leading edge comprising a set of committed leaf nodes of the directed acyclic graph is determined. Data representing the leading edge is provided to a transaction coordinator configured to use the leading edge to determine based at least in part on the leading edge to commit a transaction.

Methods of conducting database transactions. One such method comprises receiving data to be written to a database; identifying a set of shard replicas corresponding to the database to which the data is to be written; transmitting, to each of the replicas in the set, a request to write the data thereto; receiving votes back from the replicas in the set, each vote representing whether the respective replica commits to a writing of the data thereto; determining whether to commit to the writing of the data to the database according to whether a majority of the replicas of every shard having replicas in the set has transmitted a vote committing to the writing of the data thereto; and transmitting an outcome of the determining to each of the replicas in the set.

Method and apparatus for ensuring consistent outcomes in updates to distributed databases

A method and apparatus for partitioning a graph database that includes nodes connected to one another is presented. The method entails determining a node type indicating a type of node that is to be used as mapped nodes, and upon receiving a new node, placing the new node in a partition according to one or more property values associated with the new node if it is a mapped node, and placing the new node in a partition according to its connections to other nodes if it is not a mapped node. The apparatus includes modules containing computer-executable instructions to perform the above method.

Growing community of inventors

Malmo, Sweden

Mats Tobias Lindaaker