A locking scheme for associative retrieval

E. O. Onuegbe; H. C. Du

doi:10.1109/ICDE.1986.7266264

A locking scheme for associative retrieval

E. O. Onuegbe, H. C. Du

Computer Science and Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

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 language	English (US)
Article number	7266264
Pages (from-to)	574-579
Number of pages	6
Journal	Proceedings - International Conference on Data Engineering
Volume	2015-January
DOIs	https://doi.org/10.1109/ICDE.1986.7266264
State	Published - Jan 1 1986
Event	2nd IEEE International Conference on Data Engineering, COMPDEC 1986 - Los Angeles, United States Duration: Feb 5 1986 → Feb 7 1986

Keywords

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

Publisher link

10.1109/ICDE.1986.7266264

Find It

Find It at U of M Libraries

Cite this

@article{c19f6f242bd34f5baaacfc5924168f30,

title = "A locking scheme for associative retrieval",

abstract = "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.",

keywords = "associative retrieval, concurrency control, file structures, granularity of locking, locking, multi-key hashing, transaction model",

author = "Onuegbe, {E. O.} and Du, {H. C.}",

year = "1986",

month = jan,

day = "1",

doi = "10.1109/ICDE.1986.7266264",

language = "English (US)",

volume = "2015-January",

pages = "574--579",

journal = "Proceedings - International Conference on Data Engineering",

issn = "1084-4627",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2nd IEEE International Conference on Data Engineering, COMPDEC 1986 ; Conference date: 05-02-1986 Through 07-02-1986",

}

TY - JOUR

T1 - A locking scheme for associative retrieval

AU - Onuegbe, E. O.

AU - Du, H. C.

PY - 1986/1/1

Y1 - 1986/1/1

N2 - 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.

AB - 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.

KW - associative retrieval

KW - concurrency control

KW - file structures

KW - granularity of locking

KW - locking

KW - multi-key hashing

KW - transaction model

UR - http://www.scopus.com/inward/record.url?scp=0022565996&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022565996&partnerID=8YFLogxK

U2 - 10.1109/ICDE.1986.7266264

DO - 10.1109/ICDE.1986.7266264

M3 - Conference article

AN - SCOPUS:0022565996

SN - 1084-4627

VL - 2015-January

SP - 574

EP - 579

JO - Proceedings - International Conference on Data Engineering

JF - Proceedings - International Conference on Data Engineering

M1 - 7266264

T2 - 2nd IEEE International Conference on Data Engineering, COMPDEC 1986

Y2 - 5 February 1986 through 7 February 1986

ER -

A locking scheme for associative retrieval

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this