Database concurrency control using read/write set information
暂无分享,去创建一个
Abstract This paper presents a new and simple approach to database concurrency control that combines attractive features from past ideas together. The method relies on the concept of future predicate read/write sets to delay operations of transactions. Among the features included are no restarts, no deadlocks and comparatively little overhead.
[1] Walter H. Kohler,et al. A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems , 1981, CSUR.
[2] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.
[3] J. T. Robinson,et al. On optimistic methods for concurrency control , 1979, TODS.
[4] Philip A. Bernstein,et al. Concurrency Control in Distributed Database Systems , 1986, CSUR.