 |
|
| |
|
|
|
at Global Oneness Community.
Share your dreams and let others help you with the interpretation!
Dream Sharing Forum
|
|
Lock computer science - Database locks | | Lock computer science - Database locks: Encyclopedia II - Lock computer science - Database locks | | In databases, locks can be used as a means of ensuring transaction synchronisity. i.e. when making transaction processing concurrent (interleaving transactions), using 2-phased locks ensures that the concurrent execution of the transaction turns out equivalent to some serial ordering of the transaction. However, deadlocks become an unfortunate side-effect of locking in databases. Deadlocks are either prevented by pre-determining the locking order between transactions or are detected using waits-for graphs. An alternate to locking for database synchronisity while avoiding deadlocks involves the ...
See also:Lock computer science, Lock computer science - Types, Lock computer science - Implementation, Lock computer science - Granularity, Lock computer science - Database locks | | | Lock computer science, Lock computer science - Database locks, Lock computer science - Granularity, Lock computer science - Implementation, Lock computer science - Types, Semaphore (programming), Monitor (synchronization), Mutual exclusion, Critical section, Double-checked locking, Lock-free and wait-free algorithms | | |
| | | Lock computer science: Encyclopedia II - Lock computer science - Database locks
Lock computer science - Database locks
In databases, locks can be used as a means of ensuring transaction synchronisity. i.e. when making transaction processing concurrent (interleaving transactions), using 2-phased locks ensures that the concurrent execution of the transaction turns out equivalent to some serial ordering of the transaction. However, deadlocks become an unfortunate side-effect of locking in databases. Deadlocks are either prevented by pre-determining the locking order between transactions or are detected using waits-for graphs. An alternate to locking for database synchronisity while avoiding deadlocks involves the use of totally ordered global timestamps.
Other related archivesC, Concurrency control, Critical section, Dekker's, Double-checked locking, Lock-free and wait-free algorithms, Monitor (synchronization), Mutual exclusion, Peterson's algorithm, Semaphore (programming), Uniprocessor, atomic, compare-and-swap, computer science, concurrency control, database management system, deadlock, exception, execution, fetch-and-add, lock-free, multiprocessor, process, semaphore, spinlock, synchronization, test-and-set, threads of execution
 Adapted from the Wikipedia article "Database locks", under the G.N U Free Docmentation License. Please also see http://en.wikipedia.org/wiki |
|
|
|
More material related to Lock Computer Science can be found here:
|
|
|
« Back
|
Search the Global Oneness web site |
|
|
|
|
|
Sneak-Peek of Global Oneness Community
Hi friend! The Global Oneness Community, the place for information and sharing about Oneness is not really launched yet (you will see there is still some clean up to do) ...but it is now open for a sneak-peek! And if you wish - please register and become one of the very first members to do so! Jonas
Forum Home,
Articles,
Photo Gallery,
Videos,
News,
Sitemap
...and much more!
|
