Concurrency Control in Distributed Database Systems
Reads0
Chats0
TLDR
A survey of concurrency control methods for distributed database concurrency can be found in this paper, where the authors decompose the problem into two major subproblems, read-write and write-write synchronization, and describe a series of synchromzation techniques for solving each subproblem.Abstract:
In this paper we survey, consolidate, and present the state of the art in distributed database concurrency control. The heart of our analysts is a decomposition of the concurrency control problem into two major subproblems: read-write and write-write synchronization. We describe a series of synchromzation techniques for solving each subproblem and show how to combine these techniques into algorithms for solving the entire concurrency control problem. Such algorithms are called "concurrency control methods." We describe 48 principal methods, including all practical algorithms that have appeared m the literature plus several new ones. We concentrate on the structure and correctness of concurrency control algorithms. Issues of performance are given only secondary treatment.read more
Citations
More filters
Journal ArticleDOI
TSpoon: Transactions on a stream processor
TL;DR: A new model that seamlessly integrates data management capabilities within a distributed stream processor is introduced and formalize the transactional guarantees it offers, which enables developers to configure transactions obtaining strong guarantees when needed and relaxing them for higher performance when possible.
Posted Content
Transaction Repair: Full Serializability Without Locks.
TL;DR: This work builds on an incrementalized variant of leapfrog triejoin, a worst-case optimal algorithm for $\exists_1$ formulae, and on well-established techniques from programming languages: declarative languages, purely functional data structures, incremental computation, and fixpoint equations.
Proceedings ArticleDOI
Efficient algorithms for persistent transactional memory
TL;DR: In this paper, the authors explore different trade-offs in terms of memory usage vs. number of fences and flushes for durable transactions on persistent memory (PM) and present two new algorithms, named Trinity and Quadra, which implement each of them in the form of a user-level library persistent transactional memory (PTM).
Proceedings ArticleDOI
Execution privatization for scheduler-oblivious concurrent programs
Jeff Huang,Charles Zhang +1 more
TL;DR: A fundamental observation of the privatizability property for scheduler-oblivious programs is presented, that paves the theoretical foundation for privatizing shared data accesses on a path segment and a path and context sensitive privatization algorithm is presented that safely privatizes the program without introducing any additional program behavior.
Cooperation Models in Co-Design
TL;DR: This paper introduces a flexible approach to build cooperation support software by assembling basic generic cooperation bricks and shows how such a cooperation policy is implemented in a secure way thanks to a flexible transaction model.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
The notions of consistency and predicate locks in a database system
TL;DR: It is argued that a transaction needs to lock a logical rather than a physical subset of the database, and an implementation of predicate locks which satisfies the consistency condition is suggested.
Journal ArticleDOI
Monitors: an operating system structuring concept
TL;DR: In this paper, the authors develop Brinch-Hansen's concept of a monitor as a method of structuring an operating system and describe a possible method of implementation in terms of semaphores and give a suitable proof rule.
Book ChapterDOI
Notes on Data Base Operating Systems
TL;DR: This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.