×

zbMATH — the first resource for mathematics

Concurrency control by transactions carrying states and preordering multiversioned entities. (English) Zbl 0682.68098
Summary: We present a protocol for improving concurrency and preserving consistency in databases with multiversioned entities; the database can be either centralized or distributed and may or may not have data replication. In the proposed protocol, entities are assigned an order, and whenever possible each transaction accesses entities in this order; entities that need not be accessed by a transaction may be skipped by the transaction, and out-of-order accesses are permitted at an additional cost. Each transaction carries with it, as it moves along the preordered entities, the state information required to ensure serializability of schedules. At each entity, a transaction executes logically after all the transactions in the state carried to the entity by the transaction.
MSC:
68P20 Information storage and retrieval of data
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Agrawal, R.; DeWitt, D.J., Integrated concurrency control and recovery mechanisms: design and performance evaluation, ACM trans. database systems, (Dec. 1985)
[2] Agrawal, R.; Carey, M.J.; Livny, M., Models for studying concurrency control performance: alternatives and implications, (), 108-121
[3] Ahuja, M.L.; Browne, J.C.; Silberschatz, A., Optimal scheduling and concurrency improvement in data base systems, ()
[4] M. L. Ahuja, Consistency and Concurrency in Distributed Databases: Development and Evaluation of Protocols, Ph.D. Dissertation, Univ. of Texax at Austin.
[5] Ahuja, M.L.; Browne, J.C., Intra-transaction concurrency in distributed database systems and protocols which use transaction aborts to preserve consistency: A performance study, ()
[6] Ahuja, M.L.; Browne, J.C., Performance evaluation of two concurrency control protocols for distributed databases with multiversioned entities, ()
[7] Badal, D.Z.; Popeck, G.J., Proposal for distributed concurrency control for partially redundant distributed database systems, (), 273-288
[8] Badal, D.Z.; McElyea, W., A robust adaptive concurrency control for distributed databases, (), 382-391
[9] Bernstein, P.A.; Shipman, D.W.; Rothnie, J.B., Concurrency control in a system for distributed databases (SDD-1), ACM trans. database systems, 5, 18-51, (1980)
[10] Bernstein, P.A.; Goodman, N., Time stamp based algorithms for concurrency control in distributed database systems, (), 285-300
[11] Bragger, R.P.; Reimer, M., Predictive scheduling: integration of locking and optimistic methods, Technical report, inst. für informatik, ETH, zurich, (July 1983)
[12] Bhargava, B., Performance evaluation of the optimistic approach to distributed database systems and its comparison to locking, ()
[13] Ceri, S.; Owicki, S., On the use of optimistic methods for concurrency control in distributed databases, (), 117-130
[14] Eswaran, K.P.; Gray, J.N.; Lorie, R.A.; Traiger, I.L., The notions of consistency and predicate locks in a database system, Comm. ACM, 624-723, (Nov. 1976)
[15] Kung, H.T.; Robinson, J.T., Optimistic methods for concurrency control, ACM trans. database systems, 6, 213-226, (1981)
[16] Kleisser, K.; Stumptner, M., Performance of concurrency control algorithms in distributed databases with tight coupling of multi-processors at each node, (), 80-87
[17] Garcia-Molina, Hector, A performance comparison of two update algorithms for distributed databases, (), 108-122
[18] Morris, R.J.T.; Wong, W.S., Performance analysis of locking and optimistic concurrency control algorithms, (), 105-118
[19] Papadimitriou, C.H., Serializability of concurrent database updates, J. assoc. comput. Mach., 26, 4, 631-653, (1979) · Zbl 0419.68036
[20] Papadimitriou, C.H.; Kanellakis, P.C., On concurrent control by multiple versions, J. assoc. comput. Mach., 9, 1, 89-99, (1984) · Zbl 0547.68092
[21] Papadimitriou, C.H., The theory of database concurrency control, (1986), Computer Science Press · Zbl 0609.68073
[22] Reed, D.P., Naming and synchronization in decentralized computer systems, Technical report MIT/LCS/TR205, (Sept. 1978)
[23] Reed, D.P., Implementing atomic actions on decentralized data, (), 163-175
[24] Reis, D.R., The effects of concurrency control on the performance of distributed data management systems, (), 75-112
[25] Yannakakis, M.; Papadimitriou, C.H.; Kung, H.T., Locking policy: safety and freedom from deadlocks, ()
[26] Stearns, R.E.; Rosentrance, D.J., Distributed database concurrency control using before values, (), 74-83
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.