Advertisement

Scheduling adaptive transactions in real-time databases

  • Erdoğan Doğdu
Transactions and Concurrency Concepts
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)

Abstract

A new transaction model, called the Adaptive Transaction Model, is proposed for Real-Time Database Management Systems (RTDBMSs) applications. The Adaptive Transaction Model is an extended transaction model with a nested structure containing optional and required subtransactions. Adaptive Transactions (ATs) have time constraints to support real-time database applications. Optional substransactions can be omitted during the execution if time does not permit. Scheduling issues for a special case of adaptive transactions, called chain-structured adaptive transactions, are discussed. Several priority-based scheduling policies are proposed and experimental results are reported under lock-based and timestamp-ordering concurrency control protocols. A priority assignment policy (MSF-MES) is found to provide superior (low) miss ratios compared to other policies.

Keywords

Success Ratio Interarrival Time Concurrency Control Earliest Deadline First Slack Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Abb 88]
    R. Abbott and H. Garcia-Molina, “Scheduling Real-Time Transactions”, ACM SIGMOD Record, March 1988.Google Scholar
  2. [Elm 92]
    “Database Transaction Models for Advanced Applications” edited by A. K. Elmagarmid. Morgan-Kaufmann, 1992.Google Scholar
  3. [Fis 95]
    Paul A. Fishwick, “Simulation Model Design and Execution: Building Digital Worlds”, Prentice Hall, January 1995.Google Scholar
  4. [For 94]
    Paul J. Fortier, V.F. Wolfe, J.J. Prichard, “Flexible Real-Time SQL Transactions”, IEEE Real-Time Systems Symposium, 1994.Google Scholar
  5. [Gar 90]
    H. Garcia-Molina, D. Gawlick, J. Klein, K. Kleissner, K. Salem, “Coordinating Multi-Transaction Activities”, Technical Report CS-TR-247-90, Princiton University, February 1990.Google Scholar
  6. [Hou 91]
    W.C. Hou, G. Ozsoyoglu, E. Dogdu, “Estimation of COUNT Queries in Relational Databases”, ACM SIGMOD Conference, May 1991.Google Scholar
  7. [Hua 91]
    J. Huang, J. Stankovic, “On Using Inheritance in Real-Time Databases”, IEEE Real-Time Systems Symposium, 1991.Google Scholar
  8. [Liu 95]
    Susan V. Vrbsky, Jane W.S. Liu, “Producing Monotonically Improving Approximate Answers to Database Queries” in Imprecise and Approximate Computation, edited by S. Natarajan, Kluwer Academic Publishers, 1995.Google Scholar
  9. [Lip 90]
    R. Lipton, J. Naughton, “Query Size Estimation by Adaptive Sampling”, ACM PODS, 1990.Google Scholar
  10. [Ozs 90]
    G. Ozsoyoglu, Z.M. Ozsoyoglu, W.-C. Hou, “Research in Time-and Error-Constrained Database Query Processing” in Proc. Workshop Real-Time Operating Sys. Software, Charlottesville, VA, May 1990.Google Scholar
  11. [Ozs 95]
    G. Ozsoyoglu, S. Guruswamy, K. Du, W.-C. Hou, “Processing Real-Time Non-Aggregate Queries with Time-Constraints in Case-DB”, IEEE Transactions on Knowledge and Data Engineering, December 1995.Google Scholar
  12. [Ram 92]
    K. Ramamritham, “Real-Time Databases”, International Journal of Distributed and Parallel Databases, 1992.Google Scholar
  13. [Ull 88]
    J.D. Ullman, “Principles of Database and Knowledge Base Systems”, Vol.1, Computer Science Press, 1988.Google Scholar
  14. [Ulu1 94]
    O. Ulusoy, G.G. Belford, “Real-Time Transaction Scheduling in Database Systems”, Information Systems, vol18, no.8, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Erdoğan Doğdu
    • 1
  1. 1.Department of Computer Science and EngineeringCase Western Reserve UniversityCleveland

Personalised recommendations