Simulation analysis of early commit concurrency control protocols

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by P.J. Fortier Articles by J.C. Sieg, Jr.

28th Annual Simulation Symposium

Santa Barbara, California

April 25-April 28

ISBN: 0-8186-7091-6

	ASCII Text	x
	P.J. Fortier, J.C. Sieg, Jr., "Simulation analysis of early commit concurrency control protocols," Simulation Symposium, Annual, pp. 322, 28th Annual Simulation Symposium, 1995.

	BibTex	x
	@article{ 10.1109/SIMSYM.1995.393566, author = {P.J. Fortier and J.C. Sieg, Jr.}, title = {Simulation analysis of early commit concurrency control protocols}, journal ={Simulation Symposium, Annual}, volume = {0}, year = {1995}, issn = {1080-241X}, pages = {322}, doi = {http://doi.ieeecomputersociety.org/10.1109/SIMSYM.1995.393566}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Simulation Symposium, Annual TI - Simulation analysis of early commit concurrency control protocols SN - 1080-241X SP EP A1 - P.J. Fortier, A1 - J.C. Sieg, Jr., PY - 1995 KW - concurrency control; database management systems; virtual machines; transaction processing; protocols; system recovery; simulation analysis; early commit concurrency control protocols; simulation model; concurrency control enforcement; databases; atomic data sets; database design; transaction writer; conventional locking; timestamp ordering; optimistic protocols; recovery protocols; merged-commit; replay; protocols performance VL - 0 JA - Simulation Symposium, Annual ER -

P.J. Fortier, Dept. of Electr. & Comput. Eng., Massachusetts Univ., Dartmouth, MA, USA

J.C. Sieg, Jr., Dept. of Electr. & Comput. Eng., Massachusetts Univ., Dartmouth, MA, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SIMSYM.1995.393566

This paper describes results of a simulation model for decomposition of concurrency control enforcement in databases. The database is partitioned into atomic data sets using constraints defined during database design. For each atomic data set A, the transaction writer declares a point in his transaction after which there will be no more accesses to A. This location is a candidate for early commitment. We present three new concurrency control protocols: early-commit versions of conventional locking, timestamp ordering, and optimistic protocols, and two new recovery protocols: merged-commit and replay. A simulation model used to model these protocols is described. The new protocols performance is compared to that of their conventional counterparts using the described simulator.

Index Terms:

concurrency control; database management systems; virtual machines; transaction processing; protocols; system recovery; simulation analysis; early commit concurrency control protocols; simulation model; concurrency control enforcement; databases; atomic data sets; database design; transaction writer; conventional locking; timestamp ordering; optimistic protocols; recovery protocols; merged-commit; replay; protocols performance

Citation:

P.J. Fortier, J.C. Sieg, Jr., "Simulation analysis of early commit concurrency control protocols," ss, pp.322, 28th Annual Simulation Symposium, 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.