TARDiS: A Branch-and-Merge Approach to Weak Consistency

Crooks, Natacha

doi:10.1007/978-3-319-63962-8_160-1

Cited by 18 publications

(24 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Versioning is widely discussed in databases, which explores the tradeoffs between space-saving and reconstruction time of different versions of state [6,18,19].…”

Section: Related Workmentioning

confidence: 99%

Decentralized Collaborative Version Control

Nasrulin

Pouwelse

2021

Proceedings of the 2nd International Workshop on Distributed Infrastructure for Common Good

View full text Add to dashboard Cite

Decentralized systems offer alternatives to Big Tech. However, maintaining availability and correctness despite faults and manipulations in decentralized settings is challenging. In this paper, we introduce a collaborative model that is capable of exposing all observable lying, all cheating, and all faults, while only requiring merely unreliable message exchange. Our model is based on conflicting operations on arbitrary data, set reconciliation, and conflict resolution strategies to deal with branches. It is sufficiently general to support applications like Wikipedia, Github, and Datahub in a non-profit, collaborative, and decentralized form. Our protocol guarantees strong convergence despite any Byzantine nodes. We exhibit four conflict resolution strategies that cover the spectrum of possible use cases. A remarkable property of our model is that two honest nodes are guaranteed to converge despite an arbitrary-large number of faulty nodes. CCS CONCEPTS• Computer systems organization → Fault-tolerant network topologies; • Information systems → Collaborative and social computing systems and tools.

show abstract

“…Versioning is widely discussed in databases, which explores the tradeoffs between space-saving and reconstruction time of different versions of state [6,18,19].…”

Section: Related Workmentioning

confidence: 99%

Decentralized Collaborative Version Control

Nasrulin

Pouwelse

2021

Proceedings of the 2nd International Workshop on Distributed Infrastructure for Common Good

View full text Add to dashboard Cite

show abstract

“…Wu et al [60] and Veldhuizen [51] speculatively execute the transactions without conflict detection/prevention, and then the fix the broken invariants if there is any exposed conflict. TARDiS [17] and Burckhardt et al [12] allows a user to branch and merge. ConfluxDB [14] merges transactions executed in multiple snapshot isolation servers.…”

Section: Related Workmentioning

confidence: 99%

Version Reconciliation for Collaborative Databases

Ranjan

Shang²,

Krishnan

et al. 2021

Proceedings of the ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

We propose MindPalace, a prototype of a versioned database for efficient collaborative data management. MindPalace supports offline collaboration, where users work independently without real-time correspondence. The core of MindPalace is a critical step of offline collaboration: reconciling divergent branches made by simultaneous data manipulation. We formalize the concept of auto-mergeability, a condition under which branches may be reconciled without human intervention, and propose an efficient framework for determining whether two branches are auto-mergeable and identifying particular records for manual reconciliation.

show abstract

“…These protocols rely on fine-grained dependency tracking and enforce a consistency level that is weaker than CC. TARDiS [41] supports merge functions over conflicting states of the application, rather than at key granularity. This flexibility requires a significant amount of meta-data and a resource-intensive garbage collection scheme to prune old states.…”

Section: Related Workmentioning

confidence: 99%

Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store

Spirovska

Didona

Zwaenepoel

2018

2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)

View full text Add to dashboard Cite

Transactional Causal Consistency (TCC) extends causal consistency, the strongest consistency model compatible with availability, with interactive read-write transactions, and is therefore particularly appealing for geo-replicated platforms. This paper presents Wren, the first TCC system that at the same time i) implements nonblocking read operations, thereby achieving low latency, and ii) allows an application to efficiently scale out within a replication site by sharding. Wren introduces new protocols for transaction execution, dependency tracking and stabilization. The transaction protocol supports nonblocking reads by providing a transaction with a snapshot that is the union of a fresh causal snapshot S installed by every partition in the local data center and a client-side cache for writes that are not yet included in S. The dependency tracking and stabilization protocols require only two scalar timestamps, resulting in efficient resource utilization and providing scalability in terms of replication sites. In return for these benefits, Wren slightly increases the visibility latency of updates. We evaluate Wren on an AWS deployment using up to 5 replication sites and 16 partitions per site. We show that Wren delivers up to 1.4x higher throughput and up to 3.6x lower latency when compared to the state-of-the-art design. The choice of an older snapshot increases local update visibility latency by a few milliseconds. The use of only two timestamps to track causality increases remote update visibility latency by less than 15%.

show abstract

TARDiS: A Branch-and-Merge Approach to Weak Consistency

Cited by 18 publications

References 15 publications

Decentralized Collaborative Version Control

Decentralized Collaborative Version Control

Version Reconciliation for Collaborative Databases

Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store

Contact Info

Product

Resources

About