Filters








312 Hits in 4.7 sec

Towards a Non-2PC Transaction Management in Distributed Database Systems

Qian Lin, Pengfei Chang, Gang Chen, Beng Chin Ooi, Kian-Lee Tan, Zhengkui Wang
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
In this paper, we propose a transaction management scheme called LEAP to avoid the 2PC protocol within distributed transaction processing.  ...  Based on LEAP, we develop an online transaction processing (OLTP) system, L-Store, and compare it with the state-of-the-art distributed in-memory OLTP system, H-Store, which relies on the 2PC protocol  ...  Acknowledgments We would like to thank Dawei Jiang for initiating the idea of this research in February 2014, and Chang Yao and Meihui Zhang for their early tests.  ... 
doi:10.1145/2882903.2882923 dblp:conf/sigmod/LinC0OTW16 fatcat:yviyykwbm5bd5i7xfsxkux62ty

A Survey on Efficient Concurrency Control Algorithm in Distributed Database Systems

Rebecca Nyasuguta Arika, W. Cheruiyot
2019 International Journal of Scientific Research in Computer Science Engineering and Information Technology  
This paper sought to investigate the current distributed databases commit protocols such as 2PC and 3PC in order to pin-point their shortcomings.  ...  Transaction commit protocols help in reaching an agreement among the participating nodes when a transaction has to be committed or aborted.  ...  Two Phase Commit Protocol The 2PC is a distributed algorithm used in computer networks and distributed database systems, particularly when simultaneous data updates are to be applied within a distributed  ... 
doi:10.32628/cseit1952228 fatcat:jwwvl4muzbf2vjucqvbekm7ipm

Distributed transactions in practice

Prabhu Ram, Lyman Do, Pamela Drew
1999 SIGMOD record  
In this article, we will discuss the effects of applying traditional transaction management techniques to multi-tier architectures in distributed environments.  ...  In large enterprises, the model for distributed database applications has moved away from the client-server model to a multi-tier model with large database application software forming the middle tier.  ...  a distributed 2PC between the queue and the local database.  ... 
doi:10.1145/333607.333613 fatcat:pfbtpzikajdbxjcyg3dirngw6e

Towards Context-Aware Transaction Services [chapter]

Romain Rouvoy, Patricia Serrano-Alvarado, Philippe Merle
2006 Lecture Notes in Computer Science  
This paper proposes CATE: (1) a componentbased architecture of standard 2PC-based protocols and (2) a Context-Aware Transaction sErvice.  ...  Traditionally, when implementing a transaction service, a protocol is chosen and remains the same during the system execution.  ...  The coordinator part of this architecture is embedded in the transaction service whereas the participant part is implemented by resource managers (e.g., database managers) involved in the system.  ... 
doi:10.1007/11773887_21 fatcat:57xo3nejt5amxpqkugvrajekwa

Transactions in Content-Based Publish/Subscribe Middleware

Luis Vargas, Lauri I. W. Pesonen, Ehud Gudes, Jean Bacon
2007 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07)  
A transaction service, provided by the middleware, realises P/S transactions to support the transactional execution of processes on behalf of applications.  ...  In this paper we introduce publish/subscribe (P/S) transactions as an abstraction to support these needs in content-based publish/subscribe middleware.  ...  provider as a resource in a distributed transaction.  ... 
doi:10.1109/icdcsw.2007.85 dblp:conf/icdcsw/VargasPGB07 fatcat:d64mxnolpfb3pgtd6yn3eakyqu

A Systematic Study of Real time Distributed Systems in the Context of Distributed DBMS

2017 International Journal of Recent Trends in Engineering and Research  
Management of realtime information through a database system requires the incorporation of concepts from both database systems and real time systems.  ...  A number of new criteria needs to be developed to involve timing constraints of real time applications in many database systems design issues, such as query processing or transaction, data buffering, CPU  ...  DOMAIN SURVEY Managing transaction in real time distributed database systems is not easy.Appropriate management of transactions is required during the arrival, execution or at any phase of transactions  ... 
doi:10.23883/ijrter.2017.3207.uidj0 fatcat:foj62sdmsfdt7b35nf3mosmkvi

Distributed Database Management Systems: Architectural Design Choices for the Cloud [chapter]

Joarder Mohammad Mustafa Kamal, Manzur Murshed
2014 Computer Communications and Networks  
System architects and administrators often face difficulties in managing a multi-tenant distributed database system in Cloud scale as the underlying workload characteristics change frequently.  ...  In this context, distributed data management systems in the Cloud promise rapid elasticity and horizontal scalability so that Cloud applications can sustain enormous growth in data volume, velocity, and  ...  Database Management Systems Distributed Database Management Systems Distributed Database Management Systems Distributed Database Management Systems Distributed Database Management Systems  ... 
doi:10.1007/978-3-319-10530-7_2 fatcat:raz6wxqtczbwdcdn4l27mac6y4

DTranx: A SEDA-based Distributed and Transactional Key Value Store with Persistent Memory Log [article]

Ning Gao, Zhang Liu, Dirk Grunwald
2017 arXiv   pre-print
In our evaluations, DTranx reaches 514.11k transactions per second with 36 servers and 95\% read workloads. The persistent memory aware log is 30 times faster than the SSD based system.  ...  This paper proposes DTranx, a distributed key value store based on a persistent memory aware log.  ...  CONCLUSIONS We propose a transactional and scalable key value store that utilizes non-volatile memory based log with an effective and efficient garbage collection mechanism.  ... 
arXiv:1711.09543v1 fatcat:oxm2pjmdkfgu7mjhd5swlj5e5m

Path-Sensitive Atomic Commit: Local Coordination Avoidance for Distributed Transactions (Technical Report) [article]

Tim Soethout, Jurgen Vinju, Tijs van der Storm
2019 arXiv   pre-print
In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly congested (one object queuing a lot of messages at the same  ...  To ensure data-consistency and support synchronization between objects such systems often use an atomic commitment protocol such as Two-Phase commit (2PC).  ...  Orleans [Orleans 2018 ] is an actor based distributed application framework that implements transactions [Eldeeb and Bernstein 2016] in a similar way to 2PC, but with a central Transaction Manager,  ... 
arXiv:1908.05940v1 fatcat:2ixocbpcbfglbe3a2bsnehddyu

Fides: Managing Data on Untrusted Infrastructure [article]

Sujaya Maiyya, Danny Hyun Bum Cho, Divyakant Agrawal, Amr El Abbadi
2020 arXiv   pre-print
In this paper, we propose TFCommit, a novel atomic commitment protocol that executes transactions on data stored across multiple untrusted servers.  ...  Using TFCommit, we propose an auditable data management system, Fides, residing completely on untrustworthy infrastructure.  ...  INTRODUCTION A fundamental problem in distributed data management is to ensure the atomic and correct execution of transactions.  ... 
arXiv:2001.06933v1 fatcat:ocakfvphc5bitihwuyccjizrwa

The PROMPT real-time commit protocol

J.R. Haritsa, K. Ramamritham, R. Gupta
2000 IEEE Transactions on Parallel and Distributed Systems  
Further, it is easy to implement and incorporate in current database system software.  ...  PROMPT allows transactions to ªoptimisticallyº borrow, in a controlled manner, the updated data of transactions currently in their commit phase.  ...  Seshadri of Indian Institute of Technology, Bombay, participated in the initial research efforts.  ... 
doi:10.1109/71.841752 fatcat:j2p75hs3nbf23dg4dyq67yyz7i

Two New Protocols for Fault Tolerant Agreement

Poonam Saini, Awadhesh Kumar Singh
2011 International Journal of Distributed and Parallel systems  
The paper attempts to handle failures effectively, while reaching agreement, in a distributed transaction processing system.  ...  Moreover, the nodes are evacuated from the transaction system after being declared faulty. We propose a novel proactive based agreement which identifies the tentative failures in the system.  ...  An Optimistic Commit Distributed Transaction Protocol for Management [8] The work is an improvement over traditional two phase commit protocol, popularly known as 2PC algorithm.  ... 
doi:10.5121/ijdps.2011.2101 fatcat:nawmx2dstzbjdil74sod5uwkjm

Unifying consensus and atomic commitment for effective cloud data management

Sujaya Maiyya, Faisal Nawab, Divyakant Agrawal, Amr El Abbadi
2019 Proceedings of the VLDB Endowment  
Atomic commitment protocols such as Two Phase Commit (2PC) provide ACID guarantees for transactional access to sharded data and help in achieving scalability.  ...  In particular, we propose a novel protocol, Generalized PAC (G-PAC) that integrates atomic commitment and fault tolerance in a cloud paradigm involving both sharding and replication of data.  ...  Both the management of partitioned data as well as replicated data has been extensively studied for decades in the database and the distributed systems communities.  ... 
doi:10.14778/3303753.3303765 fatcat:2m7p267odnh2dmwjwjtxd5wwpq

The End of Slow Networks: It's Time for a Redesign [article]

Carsten Binnig, Andrew Crotty, Alex Galakatos, Tim Kraska, Erfan Zamanian
2015 arXiv   pre-print
In this paper, we first argue that the "old" distributed database design is not capable of taking full advantage of the network.  ...  Next generation high-performance RDMA-capable networks will require a fundamental rethinking of the design and architecture of modern distributed DBMSs.  ...  CPU Overhead The increased likelihood of conflicts is, however, not the main reason why distributed transactions in general, and 2PC specifically, are doomed to be non-scalable.  ... 
arXiv:1504.01048v2 fatcat:yezftuvowbdwlgwet6fgmyjo7y

Towards Scaling Blockchain Systems via Sharding [article]

Hung Dang, Tien Tuan Anh Dinh, Dumitrel Loghin, Ee-Chien Chang, Qian Lin, Beng Chin Ooi
2019 arXiv   pre-print
In this work, we take a principled approach to apply sharding, which is a well-studied and proven technique to scale out databases, to blockchain systems in order to improve their transaction throughput  ...  Third, we design a general distributed transaction protocol that ensures safety and liveness even when transaction coordinators are malicious.  ...  Correspondence between our distributed transaction management protocol (i.e., bottom half) and the original 2PC protocol (i.e., top half).  ... 
arXiv:1804.00399v4 fatcat:cyulzlarwfgyris4l2bty6yczi
« Previous Showing results 1 — 15 out of 312 results