Skip Navigation

The Computer Journal 1988 31(6):570-572; doi:10.1093/comjnl/31.6.570
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rennhackkamp, M. H.
Right arrow Articles by von Solms, S. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short notes

On using an Abstract Model of Distributed Database Concurrency Control Methods

M. H. Rennhackkamp1 * and S. H. von Solms2 §

1 Department of Computer Science, University of Stellenbosch, Stellenbosch, 7600, Republic of South Africa, 2 Department of Computer Science, Rand Afrikaans University, P.O. Box 524, Johannesburg 2000, Republic of South Africa

An abstract model is presented, which provides a framework for analytically evaluating and quantitatively comparing the overhead costs of distributed database concurrency control methods. It is shown that although it is basically a straightforward model, it has numerous virtues.


* Department of Computer Science, University of Stellenbosch, Stellenbosch 7600, Republic of South Africa

§ Department of Computer Science, Rand Afrikaans University, P.O. Box 524, Johannesburg 2000, Republic of South Africa


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.