ACM Home Page
Please provide us with feedback. Feedback
A multi-version concurrency scheme with no rollbacks
Full text PdfPdf (500 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing table of contents
Ottawa, Canada
Pages: 216 - 223  
Year of Publication: 1982
ISBN:0-89791-081-8
Author
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGOPS: ACM Special Interest Group on Operating Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 20,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800220.806700
What is a DOI?

ABSTRACT

The multi-version data item concept is a method for increasing concurrency in a database system. All previously proposed schemes utilizing this concept relied on transaction rollback as a means for preserving consistency. These rollbacks require a considerable amount of overhead which degrades performance. In this paper we develop a new scheme that utilizes the multi-version data item concept. Our proposed scheme ensures consistency without the use of rollbacks. It is based upon the non-two phase tree locking protocol previously proposed by Silberschatz and Kedem.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Gray, J., Notes on database operating systems. Research Report, IBM Research Lab, San Jose, Feb. 1978.
 
3
Reed, D.P. Naming and synchronization in a decentralized computer system. Ph.D. Thesis, M.I.T. Dept. of Electrical Engineering and Computer Science, Sept.1978
4
 
5
Bernstein, P.A. and Goodman, N. Time-stamp-based algorithms for concurrency control in distributed database systems. Proceedings Sixth International Conference on Very Large Data Bases (Oct. 1980), 285-300.
 
6
Honeywell File Management Supervisor, Order Number DB54, Honeywell Information Systems Inc., 1973.
 
7
Stearns, R.E., Lewis, P.M. and Rosenkrantz, D.J. Concurrency control for database systems. Proceedings IEEE Symposium on Foundations of Computer Science (Oct. 1976), 19-32.
8
 
9
Bayer, R., Elhardt, E., Heller, H. and Reiser, A. Distributed concurrency control in database systems. Proceedings Sixth International Conference on Very Large Data Bases (Oct. 1980), 275-284.
10
11
 
12
Kedem, Z., and Silberschatz, A. Non-two-phase locking protocols with shared and exclusive locks. Proceedings International Conference on Very Large Data Bases (Oct. 1980).
 
13
Kedem, Z., and Silberschatz, A. Controlling concurrency using locking protocols. Proceedings 20th IEEE Symposium on Foundations of Computer Science (Oct. 1979), 274-285.
 
14
Yannakakis, M., Papadimitriou, C.H., and Kung, H.T., Locking policy: safety and freedom from deadlock. Proceedings 20th IEEE Symposium on Foundation of Computer Science (Oct. 1979), 286-297.
 
15
Silberschatz, A., and Kedem, Z. A family of locking protocols for database systems that are modeled by directed graphs. IEEE Transactions on Software Engineering (to appear).
 
16
Fussell, D., Kedem, Z., and Silberschatz, A. A theory of correct protocols for database systems, Proceedings Seventh International Conference of Very Large Data Bases (Sept. 1981), 112-124.
17
18

CITED BY  9