This paper examines concurrency control in databases beginning with some basic terminology and issues that will be used throughout the paper, and an informal intuitive description of serializability. This paper later provides a comprehensive mathematical theory. This theory forms the basis for the development of the various algorithmic tests for serializability which guarantee the consistency of a database which permits concurrency.
|Date||01 July 1985|
|Creators||Philyaw, Remona Joyce|
|Publisher||DigitalCommons@Robert W. Woodruff Library, Atlanta University Center|
|Source Sets||Atlanta University Center|
|Source||ETD Collection for AUC Robert W. Woodruff Library|
Page generated in 0.0021 seconds