# Modeling Corruption in Eventually-Consistent Graph Databases

## TL;DR

This paper introduces a detailed model of eventual consistency in distributed graph databases, revealing how concurrent updates can cause widespread corruption even under ideal hardware conditions.

## Contribution

It provides a high-fidelity model for analyzing corruption in distributed graph databases and offers a method to estimate corruption rates for system dependability assessment.

## Key findings

- Corruption can occur and spread significantly even with fault-free hardware.
- The model enables calculation of corruption rates for system reliability evaluation.
- Design choices impact the likelihood and extent of corruption.

## Abstract

We present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from contemporary graph database management systems. To explore the problem space, we use two common graph topologies as data models for realistic experimentation. The analysis reveals, even assuming completely fault-free hardware and bug-free software, that if it is possible for updates to interfere with one-another, corruption will occur and spread significantly through the graph within the production database lifetime. Using our model, database designers and operators can compute the rate of corruption for their systems and determine whether they are sufficiently dependable for their intended use.