A Partition Checkpoint Strategy Based on Data Segment Priority  

作　　者：LIANG Ping LIU Yunsheng 

机构地区：[1]School of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,Hubei,China

出　　处：《Wuhan University Journal of Natural Sciences》2012年第2期109-113,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China (60673128)

摘　　要：A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems（ERTMMDBS） as well as to reduce the number of the transactions missing their deadlines and the recovery time.The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it;moreover,it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation.The simulation results show that the partition checkpoint strategy decreases the ratio of trans-actions missing their deadlines.A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems（ERTMMDBS） as well as to reduce the number of the transactions missing their deadlines and the recovery time.The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it;moreover,it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation.The simulation results show that the partition checkpoint strategy decreases the ratio of trans-actions missing their deadlines.

关 键 词：embedded real-time main memory database systems database recovery partition checkpoint data segment priority 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]