A characterization of database graphs admitting a simple locking protocol

Zvi Kedem, Abraham Silberschatz

Research output: Contribution to journalArticle

Abstract

A simple locking protocol is presented for transactions executing concurrently in a database. The locking protocol is not two-phase, but each entity in the database may be locked at most once by any transaction. The database is modeled by a directed graph whose vertices correspond to the entities, and whose arcs correspond to certain locking restrictions. Necessary and sufficient conditions which assure serializability and deadlock-freedom in the absence of a concurrency control are derived.

Original languageEnglish (US)
Pages (from-to)1-13
Number of pages13
JournalActa Informatica
Volume16
Issue number1
DOIs
StatePublished - Aug 1 1981

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A characterization of database graphs admitting a simple locking protocol'. Together they form a unique fingerprint.

  • Cite this