Atomicity with incompatible presumptions

Al-Houmaily, Yousef J.; Chrysanthis, Panos K.

doi:10.1145/303976.304006

Cited by 19 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The operational correctness criterion [16] represents a guiding principal for the correctness of any practical ACP. It specifically states that: 1) all sites participating in a transaction's execution should reach the same outcome for the final state of the transaction, and 2) all participating sites should be able to, eventually, forget the transaction and to garbage collect the transaction's log records.…”

Section: Failure Recovery In the Ml-iapmentioning

confidence: 99%

Extending the Intelligent Adaptive Participant's Presumption Protocol to the Multi-Level Distributed Transaction Execution Model

Al-Houmaily¹

2015

IJDMS

View full text Add to dashboard Cite

show abstract

Section: Failure Recovery In the Ml-iapmentioning

confidence: 99%

Extending the Intelligent Adaptive Participant's Presumption Protocol to the Multi-Level Distributed Transaction Execution Model

Al-Houmaily¹

2015

IJDMS

View full text Add to dashboard Cite

show abstract

“…Central logging makes participants fully dependent on the coordinator for the recovery [11]. Further more there are very strong assumptions associated with these protocols [14] [8].…”

Section: Variances Of Two-phase Commit Protocolmentioning

confidence: 99%

Performance of Short-Commit in Extreme Database Environment

Shahzad¹,

Rizwan²

2011

IJDMS

View full text Add to dashboard Cite

show abstract

“…To overcome this problem, distributed database systems use a distributed commit protocol to ensure that all the participating sites agree on the final outcome (commit/abort) of the transaction [8,87].…”

Section: Real Time Commit Protocolsmentioning

confidence: 99%

Distributed real time database systems: background and literature review

Shanker

Misra

Sarje

2008

Distrib Parallel Databases

View full text Add to dashboard Cite

Today's real-time systems (RTS) are characterized by managing large volumes of dispersed data making real-time distributed data processing a reality. Large business houses need to do distributed processing for many reasons, and they often must do it in order to stay competitive. So, efficient database management algorithms and protocols for accessing and manipulating data are required to satisfy timing constraints of supported applications. Therefore, new research in distributed real-time database systems (DRTDBS) is needed to investigate possible ways of applying database systems technology to real-time systems. This paper first discusses the performance issues that are important to DRTDBS, and then surveys the research that has been done so far on the issues like priority assignment policy, commit protocols and optimizing the use of memory in non-replicated/replicated environment pertaining to distributed real time transaction processing. In fact, this study provides a foundation for addressing performance issues important for the management of very large real time data and pointer to other publications in journals and conference proceedings for further investigation of unanswered research questions.

show abstract

Atomicity with incompatible presumptions

Cited by 19 publications

References 14 publications

Extending the Intelligent Adaptive Participant's Presumption Protocol to the Multi-Level Distributed Transaction Execution Model

Extending the Intelligent Adaptive Participant's Presumption Protocol to the Multi-Level Distributed Transaction Execution Model

Performance of Short-Commit in Extreme Database Environment

Distributed real time database systems: background and literature review

Contact Info

Product

Resources

About