The case for determinism in database systems

Thomson, Alexander; Abadi, Daniel J.

doi:10.14778/1920841.1920855

Cited by 110 publications

(74 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The two-stage execution approach has previously been explored by Thomson et al in the context of statically partitioned databases [71,72]. In this paper, we show how to extend the two-stage approach to system reconfiguration events (membership changes, data repartitioning).…”

Section: Introductionmentioning

confidence: 92%

See 1 more Smart Citation

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Unterbrunner¹,

Alonso

Kossmann

2013

The VLDB Journal

View full text Add to dashboard Cite

An elastic and highly available data store is a key component of many cloud applications. Existing data stores with strong consistency guarantees are designed and optimized for small updates, key-value access, and (if supported) small range queries over a predefined key column. This raises performance and availability problems for applications which inherently require large updates, non-key access, and large range queries. This paper presents a solution to these problems: Crescando/RB; a distributed, scan-based, main memory, relational data store (single table) with robust performance and high availability. The system addresses a real, large-scale industry use case: the Amadeus travel management system. This paper focuses on the distribution layer of Crescando/RB, the problem and theory behind it, the rationale underlying key design decisions, and the novel multicast protocol and replication framework it is composed of. Highlighting the key features of the distribution layer, we present experimental results showing that even under permanent node failures and large-scale data repartitioning, Crescando/RB remains fully available and capable of sustaining a heavy query and update load.

show abstract

Section: Introductionmentioning

confidence: 92%

“…It is a concession of the Crescando engine made in the interest of predictable performance. As shown by Thomson et al [71,72], it is possible to overlap the execution of arbitrarily complex, conditional transactions given a pre-agreed serialization order. As long as the execution is deterministic, consistency can be preserved.…”

Section: Nosql Data Storesmentioning

confidence: 99%

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Unterbrunner¹,

Alonso

Kossmann

2013

The VLDB Journal

View full text Add to dashboard Cite

show abstract

“…Database concurrency theory [4], an old age problem, has recently been revived by industry [7,17,18] and academia [25,33,6,32,29,14,16,34] due to hardware trends (e.g., multi-cores and large main memory) and application requirements (e.g., millions of transactions per second in algorithmic trading).…”

Section: Related Workmentioning

confidence: 99%

Reducing database locking contention through multi-version concurrency

Sadoghi¹,

Canim²,

Bhattacharjee³

et al. 2014

Proc. VLDB Endow.

View full text Add to dashboard Cite

In multi-version databases, updates and deletions of records by transactions require appending a new record to tables rather than performing in-place updates. This mechanism incurs non-negligible performance overhead in the presence of multiple indexes on a table, where changes need to be propagated to all indexes. Additionally, an uncommitted record update will block other active transactions from using the index to fetch the most recently committed values for the updated record. In general, in order to support snapshot isolation and/or multi-version concurrency, either each active transaction is forced to search a database temporary area (e.g., rollback segments) to fetch old values of desired records, or each transaction is forced to scan the entire table to find the older versions of the record in a multi-version database (in the absence of specialized temporal indexes).In this work, we describe a novel kV-Indirection structure to enable efficient (parallelizable) optimistic and pessimistic multi-version concurrency control by utilizing the old versions of records (at most two versions of each record) to provide direct access to the recent changes of records without the need of temporal indexes. As a result, our technique results in higher degree of concurrency by reducing the clashes between readers and writers of data and avoiding extended lock delays. We have a working prototype of our concurrency model and kV-Indirection structure in a commercial database and conducted an extensive evaluation to demonstrate the benefits of our multi-version concurrency control, and we obtained orders of magnitude speed up over the single-version concurrency control.

show abstract

“…Most of the existing proposals have been targeted at the case of full replication, where a copy of each data item is retained at each involved site. In this context, solutions have been provided coping with aspects such as protocol specification [16], and design of replication architectures based on middleware level approaches [17,18] and/or on extensions of the inner logic of individual transactional systems [16]. Comparative studies [19] have demonstrated how the solutions that coordinate the replicas via total order group communication primitives, such as [20,21], exhibit the potential for improved performance levels.…”

Section: Related Workmentioning

confidence: 99%

SCORe: A Scalable One-Copy Serializable Partial Replication Protocol

Peluso

Romano

Quaglia

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this article we present SCORe, a scalable one-copy serializable partial replication protocol. Differently from any other literature proposal, SCORe jointly guarantees the following properties: (i) it is genuine, thus ensuring that only the replicas that maintain data accessed by a transaction are involved in its processing, and (ii) it guarantees that read operations always access consistent snapshots, thanks to a one-copy serializable multiversion scheme, which never aborts read-only transactions and spares them from any (distributed) validation phase. This makes SCORe particularly efficient in presence of read-intensive workloads, as typical of a wide range of real-world applications. We have integrated SCORe into a popular open source distributed data grid and performed a large scale experimental study with well-known benchmarks using both private and public cloud infrastructures. The experimental results demonstrate that SCORe provides stronger consistency guarantees (namely One-Copy Serializability) than existing multiversion partial replication protocols at no additional overhead.

show abstract

The case for determinism in database systems

Cited by 110 publications

References 21 publications

High availability, elasticity, and strong consistency for massively parallel scans over relational data

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Reducing database locking contention through multi-version concurrency

SCORe: A Scalable One-Copy Serializable Partial Replication Protocol

Contact Info

Product

Resources

About