Using Dynamic Adjustment of Serialization Order for Real-Time Database Systems

Abstract

Studies in [7, 8, 9] concluded that for a variety of reasons, optimistic concurrency control appears well-suited to real-time database systems. Especially, they showed that in a real-time database system that discards tardy transactions, optimistic concurrency control outperforms locking. In this paper, we show that the optimistic algorithms used in those studies incur restarts unnecessary to ensure data consistency. We present a new optimistic concurrency control algorithm that can avoid such unnecessary restarts by adjusting serialization order dynamically, and demonstrate that the new algorithm outperforms the previous ones over a wide range of system workload. It appears that this algorithm is a promising candidate for basic concurrency control mechanism for real-time database systems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1993
Accession Number
ADA466196

Entities

People

  • Juhnyoung Lee
  • Sang H. Son

Organizations

  • University of Virginia

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Science
  • Consistency
  • Control Systems
  • Databases
  • Detection
  • Environment
  • Information Operations
  • Intervals
  • Multithreading
  • Probability
  • Scheduling (Production)
  • Simulations
  • Statistical Data
  • Validation
  • Workload

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Database Systems and Applications
  • Educational Psychology