This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary trans...This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary transactions are committed according to the serializable primary transaction schedule. PTCS protocol can guarantee serializability if the data copy graph contains no directed circles. It can also be ex tended to eliminate all requirements on the data copy graph. Compared to earlier works, PTCS protocol not only imposes a much weaker requirement on the data placement, but also avoids the deadlock caused by transaction waits and extra message overhead. The performance experiments show that the degradation of the performance caused by the replica man- agement of the PTCS protocol is tolerable.展开更多
Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of sa...Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.展开更多
Given the asymmetric communication capabilities in mobile real time environments, traditional serializability based approaches are too restrictive, unnecessary, and impractical. Thus propose the use of a new weaker co...Given the asymmetric communication capabilities in mobile real time environments, traditional serializability based approaches are too restrictive, unnecessary, and impractical. Thus propose the use of a new weaker correctness criterion is proposed. This paper first formally defines the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol based on this criterion is outlined for real time broadcast environments. Finally, the simulation results confirmed that the proposed techniques help mobile transactions to meet their deadlines and improve query response time.展开更多
Serializable snapshot isolation(SSI)is a promising technique to exploit parallelism for multi-core databases.However,SSI suffers from excessive transaction aborts.Existing remedies have three drawbacks:1)tracking proh...Serializable snapshot isolation(SSI)is a promising technique to exploit parallelism for multi-core databases.However,SSI suffers from excessive transaction aborts.Existing remedies have three drawbacks:1)tracking prohibitively transitive dependencies;2)aborting on every writewrite conflict;and 3)requiring manual annotation on transaction programs.In this paper,we propose to suppress transaction aborts by reassigning timestamps.We combine static analysis with augmented query plan.In this way,we save both aborts caused by read-write and write-write conflicts,without tracking transitive dependency and annotating transaction programs.As such,our approach does not exhibit drawbacks of existing methods.Extensive experiments demonstrate the effectiveness and practicality of our approach.展开更多
基金Supported by Visiting Scholar Foundation of KeyLabin University and National Lab of Switching Technology and Tele-communication Networks ([2000]123)
文摘This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary transactions are committed according to the serializable primary transaction schedule. PTCS protocol can guarantee serializability if the data copy graph contains no directed circles. It can also be ex tended to eliminate all requirements on the data copy graph. Compared to earlier works, PTCS protocol not only imposes a much weaker requirement on the data placement, but also avoids the deadlock caused by transaction waits and extra message overhead. The performance experiments show that the degradation of the performance caused by the replica man- agement of the PTCS protocol is tolerable.
文摘Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.
文摘Given the asymmetric communication capabilities in mobile real time environments, traditional serializability based approaches are too restrictive, unnecessary, and impractical. Thus propose the use of a new weaker correctness criterion is proposed. This paper first formally defines the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol based on this criterion is outlined for real time broadcast environments. Finally, the simulation results confirmed that the proposed techniques help mobile transactions to meet their deadlines and improve query response time.
基金supported by the National Key R&D Program of China(2018YFB1004401)the National Natural Science Foundation of China Key Project(Grant No.61732014).
文摘Serializable snapshot isolation(SSI)is a promising technique to exploit parallelism for multi-core databases.However,SSI suffers from excessive transaction aborts.Existing remedies have three drawbacks:1)tracking prohibitively transitive dependencies;2)aborting on every writewrite conflict;and 3)requiring manual annotation on transaction programs.In this paper,we propose to suppress transaction aborts by reassigning timestamps.We combine static analysis with augmented query plan.In this way,we save both aborts caused by read-write and write-write conflicts,without tracking transitive dependency and annotating transaction programs.As such,our approach does not exhibit drawbacks of existing methods.Extensive experiments demonstrate the effectiveness and practicality of our approach.
