Andreas Reuter
ABSTRACT
In many large database applications there are certain elements mostly containing aggregate information, which are very frequently referred to (read and modified) by many transactions. If access to such fields has to obey to conventional two-phase lock protocols (1,2), transactions will be serialized in front of these "hot spots", i.e. the degree of parallelism is reduced. To avoid this kind of lock contention some improved lock protocols have been proposed, the most interesting of which is the one implemented in IMS Fast Path (3,4), where add and subtract may be performed concurrently on numerical fields, since backout is always possible with the unique inverse of each operand. A similar scheme is proposed in (10). We expand this idea to parallel readers and writers on numerical data types, proving that under certain conditions the result of such concurrent operations is consistent in the sense that it is equal to some serial schedule (2,5).
- Fussel, D.S., Kedem, Z.M., Silberschatz, A.: A Theory of Correct Locking Protocols for Database Systems, in: Proc. 7th VLDB Conf., Cannes, 1981, pp. 112-124.Google Scholar
- Gray, J., et al.: Granularity of Locks and Degrees of Consistency in a Large Shared Data Base, in: Modelling in Data Base Management, North-Holland Publ. Comp., 1976.Google Scholar
- Gray, J.: The Transaction Concept: Virtues and Limitations, in: Proc. 7th VLDB Conf., Cannes, 1981, pp. 144-154.Google Scholar
- IMS/VS Fast Path, Overview, Order-No. GH 9096.Google Scholar
- Casanova, M.A., Bernstein, P.A.: General Purpose Schedulers for Database Systems, in: Acta Informatica, 14(1980), pp. 195-220.Google ScholarDigital Library
- Gray, J.: A Transaction Model, IBM Res. Report, No. RJ2895, San Jose, 1980.Google ScholarCross Ref
- Eswaran, K.P., et al.: The Notions of Consistency and Predicate Locks in a Data Base System, in: CACM, Vol. 19 No. 11, 1976, pp. 624-633. Google ScholarDigital Library
- Bayer, R., et al.: Parallelism and Recovery in Database Systems, in: ACM TODS, Vol. 5 No. 2, 1980, pp. 139-156. Google ScholarDigital Library
- Kung, H.T., Robinson, J.T.: An Optimistic Method for Concurrency Control, in: ACM TODS, Vol. 6 No. 2, 1981, pp. 213-226. Google ScholarDigital Library
- Schlageter, G.: Enhancement of Concurrency in Database Systems by the Use of Special Rollback Methods, in: Data Base Architecture, North-Holland Publ., 1979.Google Scholar
Recommendations
Adaptable concurrency control for atomic data types
In many distributed systems concurrent access is required to a shared object, where abstract object servers may incorporate type-specific properties to define consistency requirements. Each operation and its outcome is treated as an event, and conflicts ...
Semantics-based concurrency control: beyond commutativity
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...
High-performance concurrency control mechanisms for main-memory databases
A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this ...
Comments