| 翻訳と辞書 |
| serializability ： ウィキペディア英語版 |
serializability
In concurrency control of databases,〔Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman (1987): (''Concurrency Control and Recovery in Database Systems'' ) (free PDF download), Addison Wesley Publishing Company, ISBN 0-201-10715-5〕〔Gerhard Weikum, Gottfried Vossen (2001): (''Transactional Information Systems'' ), Elsevier, ISBN 1-55860-508-8〕 transaction processing (transaction management), and various transactional applications (e.g., transactional memory〔Maurice Herlihy and J. Eliot B. Moss. ''Transactional memory: architectural support for lock-free data structures.'' Proceedings of the 20th annual international symposium on Computer architecture (ISCA '93). Volume 21, Issue 2, May 1993.〕 and software transactional memory), both centralized and distributed, a transaction schedule is serializable if its outcome (e.g., the resulting database state) is equal to the outcome of its transactions executed serially, i.e., sequentially without overlapping in time. Transactions are normally executed concurrently (they overlap), since this is the most efficient way. Serializability is the major correctness criterion for concurrent transactions' executions. It is considered the highest level of isolation between transactions, and plays an essential role in concurrency control. As such it is supported in all general purpose database systems. ''Strong strict two-phase locking'' (SS2PL) is a popular serializability mechanism utilized in most of the database systems (in various variants) since their early days in the 1970s.
Serializability theory provides the formal framework to reason about and analyze serializability and its techniques. Though it is mathematical in nature, its fundamentals are informally (without mathematics notation) introduced below.
==Database transaction==
(詳細は
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「serializability」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|