|
|
|
@inproceedings{DBLP:conf/pods/HsuM83,
author = {Meichun Hsu and
Stuart E. Madnick},
title = {Hierarchical Database Decomposition - A Technique for Database
Concurrency Control},
booktitle = {Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles
of Database Systems, March 21-23, 1983, Colony Square Hotel,
Atlanta, Georgia},
publisher = {ACM},
year = {1983},
isbn = {0-89791-097-4},
pages = {182-191},
ee = {http://doi.acm.org/10.1145/588058.588081, db/conf/pods/HsuM83.html},
crossref = {DBLP:conf/pods/83},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
The classical approaches to enforcing serializability are the two-phase locking technique and the temestamp ordering technique. Either approach requires that a read operation from a transaction be registered (in the form of either a read timestamp or a read lock), so that a write operation from a concurrent transaction will not interfere improperly with the read operation. However, setting a lock or leaving a timestamp with a data element is an expensive operation. The purpose of the current research is to seek ways to reduce the overhead of synchronizing certain types of read accesses while achieving the goal of serializability.
To this end, a new technique of concurrency control for database management systems has been proposed. The technique makes use of a hierarchical database decomposition, a procedure which decomposes the entire database into data segments based on the access pattern of the update transactions to be run in the system. A corresponding classification of the update transactions is derived where each transaction class is `rooted' in one of the data segments. The technique requires a timestamp ordering protocol be observed for acesses within an update transaction's own root segment, but enables read accesses to other data segments to proceed without ever having to wait or to leave any trace of these accesses, thereby reducing the overhead of concurrency control. An algorithm for handling ab-hoc read-only transactions in this environment is also devised, which does not require read-only transactions to wait or set any read timestamp.
Copyright © 1983 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.