A Performance Study of the Concurrency Control Algorithms in Hierarchical Network with Partitioned Database

Abstract

It is common to have a hierarchical communication network in a military environment. If we consider each node in the network as a computer site then we have hierarchical computer network. In a hierarchical computer network, because the need of resource sharing, we now have a distributed processing system. In this system a parent node may have duplicate records of all its children. Any update of a record has to be reflected in other nodes that keep the duplicates. We need a concurrency control mechanism to guarantee the integrity of the distributed database and the serializability of concurrent updates. This thesis is the first to investigate the performance in hierarchical networks of two widely-cited concurrency control mechanisms, locking based and timestamp. Various parameters are investigated in our research: number of nodes, level of network, transaction arrival rates, and message transmission speeds, etc. We present the problem, explain the algorithms used in our simulation, analyze the results, and discuss the findings. (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1990
Accession Number
ADA227055

Entities

People

  • Eon S. Shin

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Communication Systems
  • Computations
  • Computer Networks
  • Computers
  • Control Systems
  • Data Processing
  • Database Management Systems
  • Databases
  • Engineering
  • Multithreading
  • Networks
  • Simulations
  • Simulators
  • Two Dimensional
  • United States

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Database Systems and Applications