arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.04702cs.DBcs.DCcs.PF
收藏

最终一致图数据库中的损坏建模

Modeling Corruption in Eventually-Consistent Graph Databases

Jim Webber, Paul Ezhilchelvan, Isi Mitrani

摘要:

我们提出了一个模型和分析,最终一致的图形数据库,松散合作的服务器接受并发更新分区,分布式图。该模型是高保真的,并保留了当代图形数据库管理系统的设计选择。为了探索问题空间,我们使用两种常见的图拓扑作为数据模型进行实际实验。分析表明,即使假设硬件和软件完全无故障,如果更新可能相互干扰,则会发生损坏,并在生产数据库生命周期内通过图形显著传播。使用我们的模型,数据库设计人员和操作人员可以计算他们的系统的腐败率,并确定他们是否足够可靠,以满足其预期用途。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑