Concurrency control by transactions carrying states and preordering universioned entities

  • Authors:

  • Mohan L. Ahuja;J. C. Browne

  • Affiliations:

  • Dept. of Comp. and Inf. Sc., The Ohio State Univ., Columbus, OH;Comp. Sc. Dept., U.T.Austin, Austin, TX

  • Venue:
  • CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a concurrency control protocol for databases with universioned entities; the database could be either centralized or distributed and may or may not have data replication. In this 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. Also, each transaction carries with it, as it moves along the preordered entities, the state information about all preceding transactions which must execute logically before this transaction at all succeeding entities 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.