Return
Speculative locking protocols to improve performance for distributed database systems
DOI:10.1109/TKDE.2004.1269595.png)
Abstract
En 中文
In this paper, we have proposed speculative locking (SL) protocols to improve the performance of distributed database systems (DDBSs) by trading extra processing resources. In SL, a transaction releases the lock on the data object whenever it produces corresponding after-image during its execution. By accessing both before and after-images, the waiting transaction carries out speculative executions and retains one execution based on the termination (commit or abort) mode of the preceding transactions. By carrying out multiple executions for a transaction, SL increases parallelism without violating serializability criteria. Under the naive version of SL, the number of speculative executions of the transaction explodes with data contention. By exploiting the fact that a submitted transaction is more likely to commit than abort, we propose the SL variants that process transactions efficiently by significantly reducing the number of-speculative executions. The simulation results indicate that even with manageable extra resources, these variants significantly improve-the performance over two-phase locking in the DDBS environments where transactions spend longer time for processing and transaction-aborts occur frequently.
Keywords:
distributed database
transaction processing
concurrency control
locking
performance evaluation
speculation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
No organization information available
Cited Papers
Sonic hedgehog functions upstream ofdisrupted-in-schizophrenia 1(disc1): implications for mental illness
Biology Open
IF0

