Concurrency Control Protocol for Real-Time Database and the Analysis Base on Petri Net

Article Preview

Abstract:

In the article a new concurrency control protocol for real-time database (RTCC) is proposed. The protocol based on the traditional speculative concurrency control protocol (SCC). It dynamically establish the maximum of shadow to reasonably use the resources of system and add the quasi-commit phase to avoid many unnecessary restarting and enhance the concurrency of transaction. The theory of Petri net proof and results of experiment show that this protocol is feasible and effective , and it can meet the needs of real-time transaction. Speculative Concurrency Control is suitable especially for real-time database[1]. On the one hand, SCC is similar to PCC, to detect potentially harmful conflict as early as possible, so as to start a replacement schedule, thereby increasing the opportunities for transactions to meet time limits. On the other hand, SCC is similar to OCC, it allows the concurrency of conflict transaction and, therefore, avoids unnecessary matters that may affect the timely submission of delay. As a result, it alleviates the congestion problems and PCC restart OCC's problems, in order to better meet the transaction deadline. Based on the fact above mentioned, we propose a suitable real-time database concurrency control protocol [2,3] (RTCC: Concurrency Control protocol for Real-Time). The protocol of the SCC protocol on the traditional basis with a series of improvements can avoid a large number of unnecessary transaction restart and improve concurrency. Finally, by Petri net theory it can be proved feasible and correct.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 143-144)

Pages:

12-17

Citation:

Online since:

October 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Bestavros and S. Braoudakis . A Family of Speculative Concurrency Control Algorithms. Technical Report TR-92-017, Computer Science Department, Boston University , Boston , MA, July (1992).

Google Scholar

[2] David Taniar and Sushant Goel. Concurrency Control Issues in Grid Databases. Future Generation Computure Systems 23(2007): 154-162.

DOI: 10.1016/j.future.2006.06.002

Google Scholar

[3] Jun CHEN, Yan_Li ZHU, Yue_Sheng GU. A New Speculative Concurrency Control Protocol and The Analysis base on Petri Net [J]. Computer Engineering and Applications, 2009,45(21) : 121-123.

Google Scholar

[4] A. Bestavros and S. Braoudakis. Value-Cognizant Speculative Concurrency Control. Proceedings of the International Conference on Very Large Data Bases, Zurich, Switzerland, September (1995).

Google Scholar

[5] Yongyan Wang, Qiang Wang, Hongan Wang, Guozhong Dai. Dynamic Adjustment of Execution Order in Real-Time Databases. Proceedings of the 18th International Parallel and Distributed Processing Symposium, IEEE Computer Society, Santa Fe, New Mexico, April (2004).

DOI: 10.1109/ipdps.2004.1303028

Google Scholar

[6] Zhe_Hui WU. Introduction to Petri nets [M]. Beijing: China Machine Press, (2006).

Google Scholar