Abstract
Speculative Concurrency Control (SCC) is a new concurrency control approach, especially suited for responsive database systems [5]. SCC uses potentially redundant computations to ensure that serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. We present SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms. Under SCC-nS, shadows executing on behalf of a transaction are eitheroptimisticorspeculative.Optimistic shadows execute under an assumed serialization order, which requires them to wait for no other conflicting transactions. They execute unhindered until they are either aborted or committed. Alternately, speculative shadows execute under an assumed serialization order, which requires them to wait forsomeconflicting transactions to commit We single out three SCC-nS family members, which differ in the amount of resources they require, and thus the level of speculation they perform. Finally, we present some simulation results that establish the correlation between speculation and timeliness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
