Concurrent Access to Data Structures.

Abstract

File structures designed for modern data base systems must allow a high degree of concurrent access. This holds for distributed as well as centralized data bases. Ideally, two processes that access disjoint data are allowed to proceed simultaneously, unhampered by the other's presence. However, such processes may interfere due to access path collition, for example at the root of a tree structured file. Elaborate and costly protocols have been developed to guarantee correct operation in concurrently accessed B-trees. It is shown that 2-level file structures allow simpler concurrent access protocols, and present a control scheme that strikes a good compromise between the conflicting goals of simplicity and maximal concurrency. This document proposes a definition of what it means for a file system to be correct and show that the simple and efficient protocol designed is correct. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1982
Accession Number
ADA144384

Entities

People

  • J. Nievergelt

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Access Time
  • Computer Access Control
  • Computer Programming
  • Computer Science
  • Computers
  • Consistency
  • Database Management Systems
  • Databases
  • Directories
  • Indexes
  • Multiple Access
  • Operating Systems
  • Parallel Computing
  • Parallel Processing
  • Three Dimensional
  • Time Intervals
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Database Systems and Applications
  • Theoretical Analysis.