Efficient Computation of Optimal Time for Transaction Processing in a Database System.

Abstract

Most database systems use locking for concurrency control. Responsiveness is degraded when transactions spend much time waiting for locks. In those situations in which the lockable units need not be processed in a particular order, differences in the order of processing can make large differences in the durations of the transactions, i.e., responsiveness. A backtracking or tree searching subprogram is used to determine the optimal order of processing. The subprogram uses an interesting method of tree pruning in order to perform the computation in reasonable time. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 31, 1984
Accession Number
ADA147568

Entities

People

  • D. A. Varvel
  • W. Perrizo

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Availability
  • Classification
  • Computations
  • Database Management Systems
  • Databases
  • Government Procurement
  • Governments
  • Mathematical Analysis
  • Mathematics
  • Multithreading
  • Recursive Functions
  • Security
  • Simulations
  • Simulators

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Database Systems and Applications
  • Government Contracting/Procurement.