Titlebook: Real-Time Database Systems; Issues and Applicati Azer Bestavros,Kwei-Jay Lin,Sang Hyuk Son Book 1997 Springer Science+Business Media New Yo

anagen

Scheduling Access to Temporal Data in Real-Time Databasesrld applications involve not only transactions with time constraints, but also data with time constraints. Such data, typically obtained from sensors, become inaccurate with the passage of time. Examples of such applications include autopilot systems, robot navigation, and program stock trading [14]

蔓藤圖飾

火光在搖曳

A Worst-Case Behaviour Analysis for Hard Real-Time Transactionsrder to deal with hard real-time transactions, we should analyse worst-case behaviours and test for schedulability. We can then prevent the potential catastrophic consequence that could arise from missing hard deadlines. So far, however, most researchers in RTDB have been pessimistic about the possi

instulate

猛擊

Book 1997ers who wish to understand the issuesinvolved in the design and development of RTDBS. .Real-Time DatabaseSystems: Issues. .and Applications. fulfills this need. Thisbook presents the spectrum of issues that may arise in variousreal-time database applications, the available solutions andtechnologies

ineptitude

向前變橢圓

Probabilistic Real-Time Data Access with Deadline and Interval Constraintsto provide well-defined interfaces between different software modules [14, 23]. Typically these tasks are subject to a range of timing constraints, which require the DBMS to provide timing guarantees, sometimes under complex operating conditions.

Nonflammable

reject

Real-Time Database Benchmark Design for Avionics Systems capabilities to handle time-critical transactions. Some examples are databases for safety-critical applications like air traffic control, avionics systems, process control, and medical service systems.

惰性氣體

A Worst-Case Behaviour Analysis for Hard Real-Time Transactions conflicts between transactions. And therefore they can only deal with soft or firm transactions. In previous works, they also assume that the response time of transaction is known in advance, can be estimated with maximum slack times, or is not needed [6, 9].