Concurrency control in distributed databases through time intervals and short-term locks

A method for concurrency control in distributed database management systems that increases the level of concurrent execution of transactions, called ordering by serialization numbers (OSN), is proposed. The OSN method works in the certifier model and uses time-interval techniques in conjunction with...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering Vol. 15; no. 8; pp. 994 - 1003
Main Authors: Halici, U., Dogac, A.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.08.1989
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Subjects:
990200 - Mathematics & Computers
Algorithm design and analysis
Applied sciences
Communication system control
Computer science; control theory; systems
COMPUTERIZED SIMULATION
Concurrency control
Concurrent computing
Control
Control algorithms
Costs
DATA BASE MANAGEMENT
Data base management systems
DATA PROCESSING
Distributed
DISTRIBUTED DATA PROCESSING
Distributed databases
Exact sciences and technology
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
Information systems. Data bases
MANAGEMENT
Memory organisation. Data processing
PARALLEL PROCESSING
Performance analysis
PERFORMANCE TESTING
PROCESSING
PROGRAMMING
Scheduling
SIMULATION
Software
Studies
System recovery
TESTING
Transaction databases
Concurrency control
Distributed database
Integrated planning
Database management system
Comparative study
ISSN:0098-5589, 1939-3520
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A method for concurrency control in distributed database management systems that increases the level of concurrent execution of transactions, called ordering by serialization numbers (OSN), is proposed. The OSN method works in the certifier model and uses time-interval techniques in conjunction with short-term locks to provide serializability and prevent deadlocks. The scheduler is distributed, and the standard transaction execution policy is assumed, that is, the read and write operations are issued continuously during transaction execution. However, the write operations are copied into the database only when the transaction commits. The amount of concurrency provided by the OSN method is demonstrated by log classification. It is shown that the OSN method provides more concurrency than basic timestamp ordering and two-phase locking methods and handles successfully some logs which cannot be handled by any of the past methods. The complexity analysis of the algorithm indicates that the method works in a reasonable amount of time.< >
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.31355