A Scheduling Algorithm Based on Priority and its Implementation for Real-Time Transactions of Data Stream Database

There are two kinds of complex relations in the continuous query transaction in data stream database, of which one is that a transaction depends on the other transactions and the other is that many transactions can share one operator.A scheduling algorithm based on combining slack time and value is presented in this paper.The influence of real-time transaction complex relations is sufficiently considered.Furthermore,The algorithm's implement including transaction acceptance policy and transaction completion/abortion policy is given using three special double-linked lists.In the end,based on hit value ratio and differentiated guarantee ratio, an experiment which testes the LSV performance is completed in GStream.The experimental results show that the LSV algorithm can improve the performance compared to the classical RR、LSF and HVF algorithms.