Graph Database Commit with TxDAG Majority Agreement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Graph database management systems face challenges in maintaining data consistency and scalability, particularly in distributed systems where relationships spanning servers are susceptible to corruption, leading to inconsistencies that compound over time.
Innovation Solution
A transactional commit protocol based on safe conjunction of majorities, utilizing a directed acyclic graph (TxDAG) to track transactions and ensure consistency across replicated and distributed database systems, allowing concurrent updates while upholding ACID properties and ensuring reciprocal consistency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If distributed graph database systems partition data across multiple servers to improve throughput, then productivity increases, but data consistency and reliability deteriorate due to corruption risks in relationships spanning servers
Solution Approach 1:
The system segments the graph database into shards distributed across multiple servers, with each server managing a portion of the graph data. This segmentation enables parallel processing and improved throughput while maintaining consistency through the conjunction of majorities protocol that coordinates changes across segmented data portions.
Solution Approach 2:
The patent introduces an intermediary coordination mechanism (the conjunction of majorities protocol) that mediates between distributed servers to ensure consistency. This intermediary layer reconciles changes across servers, preventing corruption of relationships that span multiple partitions while allowing distributed processing to proceed.
2Device complexity
If contemporary distributed graph databases use update algorithms to improve scalability, then device complexity decreases, but data reliability worsens due to susceptibility to corruption even in absence of faults
Solution Approach 1:
The system performs preliminary validation and coordination actions before committing updates across distributed servers. The conjunction of majorities protocol requires pre-agreement from majority quorums on each server before allowing changes, preventing corruption before it can propagate through the distributed system.
Solution Approach 2:
The patent implements feedback mechanisms where servers report their state and receive coordination signals from the conjunction of majorities protocol. This feedback loop ensures that updates are only committed when consistency conditions are met, providing continuous verification of data integrity across the distributed system.
3Productivity
If graph databases use relationships spanning multiple servers to distribute data, then productivity increases, but manufacturing precision deteriorates as corruption compounds over time through the graph structure
Solution Approach 1:
The system provides beforehand cushioning against corruption by implementing the conjunction of majorities protocol that prevents corrupt updates from being committed in the first place. This protective mechanism cushions the system against the compounding effect of corruption that would otherwise spread through the graph structure over time.
Solution Approach 2:
The patent applies preliminary anti-action by implementing validation rules and consistency checks that prevent corrupt relationships from being created or propagated. This anti-action occurs before corruption can compound through the graph structure, blocking the harmful effect at its source rather than attempting to correct it later.
Data Source
AI summary
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.