Skip Navigation

The Computer Journal 1976 19(1):17-20; doi:10.1093/comjnl/19.1.17
© 1976 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 (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Schlageter, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The problem of lock by value in large data bases

G. Schlageter *

Universitat Karlsruhe, Institut fur Angewandte Informatik und Formale Beschreibungsverfahren, Karlsruhe, Germany

In parallel-accessed database systems a process must be able to lock a subset of the data. In current systems and proposals the only way for locking a set of data is either to lock explicitly each element in the set of to lock a large predefined set, such as a whole file. Though the necessity of a more flexible locking feature is recognised there are no results as to conceptual foundation and implementation. In this paper a concept for lock by value is developed which allows a process to lock a subset of the database just by specifying a condition describing this set. Thought the concept looks rather simple some unpleasant problems have to be discussed. A locking system supporting current lock features at the record-level as well as lock by value is proposed.

Received June 1975.

* Universität Karlsruhe, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, D 75 Karlsruhe, Postfach 6380, Germany


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.