A locking scheme for associative retrieval

E. O. Onuegbe, H. C. Du

Research output: Contribution to journalConference articlepeer-review


The general problem of concurrency control for database systems has been studied intensively. However, the studies often ignored the underlying file systems. A locking scheme for multi-key hashed file structures is presented in this paper. First, we define a transaction model for such file structures, then we present techniques for conflict detection as well as a new locking scheme. The locking scheme combines aspects of both physical and predicate locking schemes. It places locks on buckets while guaranteeing record-level access; this results in increased concurrency with minimal overhead.

Original languageEnglish (US)
Article number7266264
Pages (from-to)574-579
Number of pages6
JournalProceedings - International Conference on Data Engineering
StatePublished - Jan 1 1986
Event2nd IEEE International Conference on Data Engineering, COMPDEC 1986 - Los Angeles, United States
Duration: Feb 5 1986Feb 7 1986


  • associative retrieval
  • concurrency control
  • file structures
  • granularity of locking
  • locking
  • multi-key hashing
  • transaction model


Dive into the research topics of 'A locking scheme for associative retrieval'. Together they form a unique fingerprint.

Cite this