66 Hits in 5.0 sec

G-Tran: Making Distributed Graph Transactions Fast [article]

Hongzhi Chen, Changji Li, Chenguang Zheng, Chenghuan Huang, Juncheng Fang, James Cheng, Jian Zhang
2021 arXiv   pre-print
sets in graph transactions.  ...  In addition, we propose a new MV-OCC implementation with two optimizations to address the issue of large read/write sets in graph transactions.  ...  Our MV-OCC follows a general procedure of OCC but combines with our multi-version-based commit/abort rules.  ... 
arXiv:2105.04449v2 fatcat:xy42pubn6fardmiuwlqxcf3noy


B. Mejías, P. Van Roy
2010 International Journal of Adaptive, Resilient and Autonomic Systems  
Distributed systems with a centralized architecture present the well known problems of single point of failure and single point of congestion. Therefore, they do not scale.  ...  We present a decentralized system built with a structured overlay network which is self-organized and self-healing, providing a transactional replicated storage for small or large scale systems.  ...  As there is no read-phase, it is important that the decision is transmitted to the TPs and rTMs together with the new state of the item, and not only a commit/abort message.  ... 
doi:10.4018/jaras.2010070101 fatcat:of5pt4kddbhxhddgunxv2zp2ly

Towards the Integration of Distributed Transactional Memories in Application Servers' Clusters [chapter]

Paolo Romano, Nuno Carvalho, Maria Couceiro, Luís Rodrigues, João Cachopo
2009 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
Distributed Transactional Memories (DTMs) represent a very recent branching of the research line on TMs, aimed at enhancing their scalability and dependability.  ...  Transactional Memories (TM) are regarded as one of the most promising approaches to address this issue, as highlighted by the huge interest garnered in the research community over the last years.  ...  the updates and reach cluster-wide agreement on the outcome (commit/abort) of transactions.  ... 
doi:10.1007/978-3-642-10625-5_48 fatcat:g7nfypkyrfgtzc7a454eovaqzq


Tim Kraska, Gene Pang, Michael J. Franklin, Samuel Madden, Alan Fekete
2013 Proceedings of the 8th ACM European Conference on Computer Systems - EuroSys '13  
Replicating data across multiple data centers allows using data closer to the client, reducing latency for applications, and increases the availability in the event of a data center failure.  ...  Our experiments show that MDCC outperforms existing synchronous transactional replication protocols, such as Megastore, by requiring only a single message round-trip in the normal operational case independent  ...  Acknowledgments We would like to thank the anonymous reviewers and our shepherd, Robbert van Renesse, for all the helpful comments and suggestions.  ... 
doi:10.1145/2465351.2465363 dblp:conf/eurosys/KraskaPFMF13 fatcat:p6ggj6zxy5cp7mrudoz2qmsoyu

ParTAC: A Partition-Tolerant Atomic Commit Protocol for MANETs

Brahim Ayari, Abdelmajid Khelil, Neeraj Suri
2010 2010 Eleventh International Conference on Mobile Data Management  
ParTAC is evaluated using simulations to demonstrate the performance of the protocol in terms of commit rate, message efficiency and Commit/Abort decision time.  ...  The support of distributed atomic transactions in mobile ad-hoc networks (MANET) is a key requirement for many mobile application scenarios.  ...  Our analysis shows that ParTAC reduces the Commit/Abort decision time of initiated transactions and helps in trading-off the desired level of the availability, latency and efficiency of the transactional  ... 
doi:10.1109/mdm.2010.25 dblp:conf/mdm/AyariKS10 fatcat:jf3oawieanaohdmq3vmyxeedxe

Aria: A Fast and Practical Deterministic OLTP Database

Yi Lu, Xiangyao Yu, Lei Cao, Samuel Madden
2020 Proceedings of the VLDB Endowment  
Deterministic databases are able to efficiently run transactions across different replicas without coordination.  ...  In this paper, we present Aria, a new distributed and deterministic OLTP database that does not have this limitation.  ...  We thank the reviewers for their valuable comments. Yi Lu is supported by the Facebook PhD Fellowship.  ... 
dblp:journals/pvldb/LuYCM20 fatcat:jzitwcy7tzh3rjwcj5nlf7eiwq

Towards scalable real-time analytics

Anil K. Goel, Wolfgang Lehner, Jeffrey Pound, Nathan Auch, Peter Bumbulis, Scott MacLean, Franz Färber, Francis Gropengiesser, Christian Mathis, Thomas Bodner
2015 Proceedings of the VLDB Endowment  
We present an overview of our work on the SAP HANA Scale-out Extension, a novel distributed database architecture designed to support large scale analytics over realtime data.  ...  We advocate the decoupling of core database components such as query processing, concurrency control, and persistence, a design choice made possible by advances in highthroughput low-latency networks and  ...  Acknowledgements We would like to thank the HANA Research and Development team for their incredible ongoing efforts.  ... 
doi:10.14778/2824032.2824069 fatcat:l5e333puhveknacqp2bc2r75t4

Hyder - A Transactional Record Manager for Shared Flash

Philip A. Bernstein, Colin W. Reid, Sudipto Das
2011 Conference on Innovative Data Systems Research  
Each transaction executes on a snapshot, logs its updates in one record, and broadcasts the log record to all servers.  ...  Each server rolls forward the log against its locally-cached partial-copy of the last committed state, using optimistic concurrency control to determine whether each transaction commits.  ...  We also thank our collaborators on the meld implementation, Ming Wu and Xinhao Yuan, and on the log implementation, Mahesh Balakrishnan, Dahlia Malkhi, and Vijayan Prabhakaran.  ... 
dblp:conf/cidr/BernsteinRD11 fatcat:zrmln4ljuzatfplu4nhxejr4le

Bringing Modular Concurrency Control to the Next Level

Chunzhi Su, Natacha Crooks, Cong Ding, Lorenzo Alvisi, Chao Xie
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
This paper presents Tebaldi, a distributed key-value store that explores new ways to harness the performance opportunity of combining different specialized concurrency control mechanisms (CCs) within the  ...  When running the TPC-C benchmark, Tebaldi yields more than 20× the throughput of the basic two-phase locking protocol, and over 3.7× the throughput of Callas, a recent system that, like Tebaldi, aims to  ...  Natacha Crooks was partially supported by a Google Fellowship in Distributed Computing.  ... 
doi:10.1145/3035918.3064031 dblp:conf/sigmod/SuCDAX17 fatcat:hvx6jbybxrax5allblhzaavfni

Granola: Low-Overhead Distributed Transaction Coordination

James A. Cowling, Barbara Liskov
2012 USENIX Annual Technical Conference  
This paper presents Granola, a transaction coordination infrastructure for building reliable distributed storage applications.  ...  We implemented the TPC-C benchmark on Granola, and achieved 3× the throughput of a platform using a locking approach.  ...  Acknowledgments We thank Dan Ports, the anonymous reviewers, and our shepherd, Jon Howell, for their helpful feedback. This research was supported under NSF grant CNS-0834239.  ... 
dblp:conf/usenix/CowlingL12 fatcat:s66pxwtgurdkfao4f4d6zzllke

Transactional Failure Recovery for a Distributed Key-Value Store [chapter]

Muhammad Yousuf Ahmad, Bettina Kemme, Ivan Brondino, Marta Patiño-Martínez, Ricardo Jiménez-Peris
2013 Lecture Notes in Computer Science  
In particular, if the transaction manager provides durability (e.g., through logging), then we can relax durability constraints in the key-value store.  ...  With the advent of cloud computing, many applications have embraced the ensuing paradigm shift towards modern distributed keyvalue data stores, like HBase, in order to benefit from the elastic scal ability  ...  This research has been partially funded by the Minist`ere de l'Enseignement sup´erieur, de la Recherche, de la Science et de la  ... 
doi:10.1007/978-3-642-45065-5_14 fatcat:6iqudxn6sjbbjelnqku6vslcce

Beyond 1-Safety and 2-Safety for Replicated Databases: Group-Safety [chapter]

Matthias Wiesmann, André Schiper
2004 Lecture Notes in Computer Science  
In this paper, we study the safety guarantees of group communication-based database replication techniques.  ...  Experimental results show the gain of efficiency of group-safety over lazy replication, which ensures only 1-safety.  ...  The main difference with Figure 2 is the response to the client, which is sent back as soon as the transactions is delivered by the atomic broadcast and the decision to commit/abort the transaction is  ... 
doi:10.1007/978-3-540-24741-8_11 fatcat:2phjbaidovct7pbv7acodotmca

An Extended Transaction Environment for Workflows in Distributed Object Computing

Dimitrios Georgakopoulos, Mark F. Hornick, Frank Manola, Michael L. Brodie, Sandra Heiler, Farshad Nayeri, Benjamin Hurwitz
1993 IEEE Data Engineering Bulletin  
The Bulletin of the Technical Committee on Data Engineering is published quarterly and is distributed to all TC members.  ...  Membership in the TC on Data Engineering is open to all current members of the IEEE Computer Society who are interested in database systems.  ...  Acknowledgement: The authors wish to thank colleagues at Apeldoorn, Holland, and Palo Alto, CA, for their contribution to the work on Echo and RFM.  ... 
dblp:journals/debu/GeorgakopoulosHMBHNH93 fatcat:fde74rfyljdt5asuplwcx3cqpy

The case for determinism in database systems

Alexander Thomson, Daniel J. Abadi
2010 Proceedings of the VLDB Endowment  
Further, our system eliminates the requirement for two-phase commit for any kind of distributed transaction, even across multiple nodes within the same replica.  ...  Due to the nondeterminism inherent in traditional concurrency control schemes, however, special care must be taken to ensure that replicas don't diverge.  ...  In order to satisfy ACID's guarantees, distributed transactions generally use a distributed commit protocol, typically two-phase commit, in order to gather the commit/abort decisions of all participating  ... 
doi:10.14778/1920841.1920855 fatcat:svy4tmqvl5arfmilhlxstjzh4i

Managing real-time database transactions in mobile ad-hoc networks

Le Gruenwald, Shankar M. Banik, Chuo N. Lau
2007 Distributed and parallel databases  
and the distribution of energy consumption among mobile hosts.  ...  This paper proposes a solution for transaction management that reduces the number of transactions missing deadlines while balancing the energy consumption by the mobile hosts in the system.  ...  to commit in order to decide whether the transaction should be committed/aborted.  ... 
doi:10.1007/s10619-006-7008-2 fatcat:qdtpkbcjhrhpfamacayjq6kdxi
« Previous Showing results 1 — 15 out of 66 results