Serializable isolation for snapshot databases

Cahill, Michael J.; Röhm, Uwe; Fekete, Alan

doi:10.1145/1376616.1376690

Cited by 116 publications

(168 citation statements)

References 17 publications

Supporting

Mentioning

164

Contrasting

Order By: Relevance

“…The idea of supporting atomicity and consistency for multi row distributed transaction is not new. Our work is mainly inspired by Zhang and De Sterck (2010), Padhye and Tripathi (2012), Berenson et al (1995), Lars (2011), Cahill et al (2008, Fekete et al (2004Fekete et al ( , 2005 and Revilak et al (2011). Zhang and De Sterck (2010) proposed a technique to achieve SI by creating number of global tables for storing transactional metadata in HBase itself and using them for each transaction.…”

Section: Related Literaturesmentioning

confidence: 99%

Preserving atomicity and isolation for multi-row transactions in column-oriented heterogeneous distributed databases

Jain

Kumar

Ramesh

2017

IJICT

View full text Add to dashboard Cite

Abstract:Traditional databases have limitation of scalability with respect to data as well as number of clients. Column-oriented databases have overcome this feature by minimising the cost. Column-oriented databases only ensure single row atomic transaction and does not support snapshot isolation. This paper presents about strong snapshot isolation (SI) and atomicity for multi-row distributed transactions in HBase. This HBase snapshot isolation uses a novel approach and handles distributed transactions at the end of individual clients. This is also designed to be scalable across large distributed databases in terms of data distribution. Some experiments have been performed extensively to preserve atomicity for distributed transactions in various environments. Experimental results show that the proposed methodology can serve better to preserve atomicity and snapshot isolation in column-oriented HDDBs for multi-row transactions.Keywords: column-oriented database; multi-row transaction; heterogeneous distributed database; RDBMS; HBase; snapshot isolation. Preserving atomicity and isolation for multi-row transactions 97Chiranjeev Kumar received his ME and PhD from Motilal

show abstract

Section: Related Literaturesmentioning

confidence: 99%

Preserving atomicity and isolation for multi-row transactions in column-oriented heterogeneous distributed databases

Jain

Kumar

Ramesh

2017

IJICT

View full text Add to dashboard Cite

show abstract

“…This will be the case assuming: (a) the use of strict two-phase locking (S2PL) for isolation, (b) no writes of dirty pages of uncom mitted transactions, obviating the need for undo logging, so that correctness is ensured despite potential non-deterministic transaction aborts resulting from deadlocks. Other transac tional isolation protocols, like serializable snapshot isolation (SSI) [1] , unfortunately do not guarantee that commit order is the same as the serial equivalent execution order. Further more, it's unclear what the semantics of command log-based recovery are in the face of non-serializable isolation levels like snapshot isolation (which is widely used in practice).…”

Section: Generalizing Command Loggingmentioning

confidence: 99%

Rethinking main memory OLTP recovery

Malviya¹,

Weisberg²,

Madden³

et al. 2014

2014 IEEE 30th International Conference on Data Engineering

102

View full text Add to dashboard Cite

Abstract-Fine-grained, record-oriented write-ahead logging, as exemplified by systems like ARIES, has been the gold standard for relational database recovery. In this paper, we show that in modern high-throughput transaction processing systems, this is no longer the optimal way to recover a database system. In particular, as transaction throughputs get higher, ARIEs-style logging starts to represent a non-trivial fraction of the overall transaction execution time.We propose a lighter weight, coarse-grained command logging technique which only records the transactions that were executed on the database. It then does recovery by starting from a trans actionally consistent checkpoint and replaying the commands in the log as if they were new transactions. By avoiding the overhead of fine-grained logging of before and after images (both CPU complexity as well as substantial associated 110), command logging can yield significantly higher throughput at run-time.Recovery times for command logging are higher compared to an ARIEs-style physiological logging approach, but with the advent of high-availability techniques that can mask the outage of a recovering node, recovery speeds have become secondary in importance to run-time performance for most applications.We evaluated our approach on an implementation of TPC C in a main memory database system (VoltDB), and found that command logging can offer 1.5 x higher throughput than a main memory optimized implementation of ARIEs-style physiological logging.

show abstract

“…Another direction for future work is to use outheritance for the out of order transactions used in the k-means finding problem [34] or the snapshot isolated transactions used in database applications [35].…”

Section: Related Workmentioning

confidence: 99%

Composing Relaxed Transactions

Gramoli

Guerraoui

Leţia

2013

2013 IEEE 27th International Symposium on Parallel and Distributed Processing

View full text Add to dashboard Cite

Abstract-As the classic transactional abstraction is sometimes considered too restrictive in leveraging parallelism, a lot of work has been devoted to devising relaxed transactional models with the goal of improving concurrency. Nevertheless, the quest for improving concurrency has somehow led to neglect one of the most appealing aspects of transactions: software composition, namely, the ability to develop pieces of software independently and compose them into applications that behave correctly in the face of concurrency. Indeed, a closer look at relaxed transactional models reveals that they do jeopardize composition, raising the fundamental question whether it is at all possible to devise such models while preserving composition. This paper shows that the answer is positive.We present outheritance, a necessary and sufficient condition for a (potentially relaxed) transactional memory to support composition. Basically, outheritance requires child transactions to pass their conflict information to their parent transaction, which in turn maintains this information until commit time. Concrete instantiations of this idea have been used before, classic transactions being the most prevalent example, but we believe to be the first to capture this as a general principle as well as to prove that it is, strictly speaking, equivalent to ensuring composition.We illustrate the benefits of outheritance using elastic transactions and show how they can satisfy outheritance and provide composition without hampering concurrency. We leverage this to present a new (transactional) Java package, a composable alternative to the concurrency package of the JDK, and evaluate efficiency through an implementation that speeds up state of the art software transactional memory implementations (TL2, LSA, SwissTM) by almost a factor of 3.

show abstract

Serializable isolation for snapshot databases

Cited by 116 publications

References 17 publications

Preserving atomicity and isolation for multi-row transactions in column-oriented heterogeneous distributed databases

Preserving atomicity and isolation for multi-row transactions in column-oriented heterogeneous distributed databases

Rethinking main memory OLTP recovery

Composing Relaxed Transactions

Contact Info

Product

Resources

About