Improving the Performance of Read-Only Transactions Through Speculation

Ragunathan, T.; Reddy, P. Krishna

doi:10.1007/978-3-540-75512-8_15

Cited by 8 publications

(7 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the start of new transactions must be blocked until no holes are present to satisfy Property P6 and generate a lGSI-schedule. Nevertheless, this is an interesting approach in terms of performance as transaction reordering has been shown as a valid approach to increase the throughput of the system [28,36].…”

Section: Discussion Of Concrete Protocolsmentioning

confidence: 99%

A formal characterization of SI-based ROWA replication protocols

Armendáriz-Iñigo

Juárez-Rodríguez

Mendívil

et al. 2011

Data & Knowledge Engineering

View full text Add to dashboard Cite

Snapshot Isolation (SI) is commonly used in some commercial DBMSs with a multiversion concurrency control mechanism since it never blocks read-only transactions. Recent database replication protocols have been designed using SI replicas where transactions are firstly executed in a delegate replica and their updates (if any) are propagated to the rest of replicas at commit time; i.e. they follow the Read One Write All (ROWA) approach. This paper provides a formalization that shows correctness of abstract protocols which cover these replication proposals. These abstract protocols differ in the properties demanded for achieving a global SI level and those needed for its Generalized SI (GSI) variant -allowing reads from old snapshots-. Additionally, we propose two more relaxed properties that also ensure a global GSI level. Thus, some applications can further optimize their performance in a replicated system while obtaining GSI.

show abstract

Section: Discussion Of Concrete Protocolsmentioning

confidence: 99%

A formal characterization of SI-based ROWA replication protocols

Armendáriz-Iñigo

Juárez-Rodríguez

Mendívil

et al. 2011

Data & Knowledge Engineering

View full text Add to dashboard Cite

show abstract

“…Each node has a pool of servers, all having identical capabilities and serving one global queue of transactions [17]. The system is assumed to be reliable and scalable in terms of capacity [23].…”

Section: Simulation Environmentmentioning

confidence: 99%

Secure Network using Secure Hash Algorithm-3 with Locking Protocol in Distributed Database System

2017

IJCSI

View full text Add to dashboard Cite

The two phase locking protocol provides controlled access to a data item and prevents data inconsistencies in the distributed database system. The hashing algorithm is used to calculate hash value for the requested data item and the generated hash value is used as a medium to secure the communication between server and client connected through a network. This paper presents a methodology which is used to secure network of a distributed database system while processing requests for data items from various users at the same time. The concurrency control issues are resolved using two phase locking protocol and the security issue is resolved using secure hash algorithm-3, 512 variant. By performing extensive experiments, the performance of the proposed method is epitomized. Performance parameters like throughput, accuracy are calculated to compare the proposed methodology with the hash based optimistic concurrency control algorithm.

show abstract

“…In other words, for a consistent snapshot of data, only the first committer can update its changes and other transactions are forced to abort. This kind of discipline is called firstcommitter-wins rule (FCWR) in queueing theory [7]. Researchers have studied the effectiveness and performance of MVCC by taking simulation experiments [8], [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Modeling and Analysis of Multi-version Concurrent Control

Chen

Okamura

2013

2013 IEEE 37th Annual Computer Software and Applications Conference

View full text Add to dashboard Cite

A multi-version concurrent control (MVCC) is widely spread as an important scheme to ensure the data integrity even in on-line storage services such as Dropbox as well as database management system. The scheme of MVCC is to make a snapshot of the current data before access to the data, and to compare the snapshot with the original data just before the update is committed. This discipline is called first-committer-wins rule (FCWR). This paper focuses on the performance evaluation of MVCC based on a stochastic model. According to queueing analysis, we derive quantitative performance measures from the model analytically. Further, we reveal the effectiveness of MVCC by comparing with the serializable policy.

show abstract

Improving the Performance of Read-Only Transactions Through Speculation

Cited by 8 publications

References 12 publications

A formal characterization of SI-based ROWA replication protocols

A formal characterization of SI-based ROWA replication protocols

Secure Network using Secure Hash Algorithm-3 with Locking Protocol in Distributed Database System

Modeling and Analysis of Multi-version Concurrent Control

Contact Info

Product

Resources

About