Skip to main content
SpringerLink
Log in

Real-time databases

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

Data in real-time databases has to be logically consistent as well as temporally consistent. The latter arises from the need to preserve the temporal validity of data items that reflect the state of the environment that is being controlled by the system. Some of the timing constraints on the transactions that process real-time data come from this need. These constraints, in turn, necessitate time-cognizant transaction processing so that transactions can be processed to meet their deadlines.

This paper explores the issues in real-time database systems and presents an overview of the state of the art. After introducing the characteristics of data and transactions in real-time databases, we discuss issues that relate to the processing of time-constrained transactions. Specifically, we examine different approaches to resolving contention over data and processing resources. We also explore the problems of recovery, managing I/O, and handling overloads. Real-time databases have the potential to trade off the quality of the result of a query or a transaction for its timely processing. Quality can be measured in terms of the completeness, accuracy, currency, and consistency of the results. Several aspects of this trade-off are also considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Abbott and H. Garcia-Molina, “Scheduling real-time transactions: a performance evaluation,” inProc. 14th VLDB Conf., 1988.

  2. R. Abbott and H. Garcia-Molina, “Scheduling real-time Transactions with disk resident data,” inProc. 15th VLDB Conf., 1989.

  3. R. Abbott and H. Garcia-Molina, “Scheduling I/O requests with deadlines: a performance evaluation,” inProc. Real-time Systems Symp. 1990.

  4. N. Audsley, A. Burns, M. Richardson, and A. Wellings, “A database model for hard real-time systems,” Technical Report, Real-Time Systems Group, University of York, U.K., 1991.

  5. B.R. Badrinath and K. Ramamritham, “Semantics-based concurrency control: beyond commutativity,”ACM Trans. Database Systems, vol. 17, no. 1, pp. 163–199, March 1992.

    Google Scholar 

  6. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, “On the competitiveness of on-line real-time scheduling,” inProc. Real-Time Systems Symp., 1991.

  7. P.A. Bernstein, V. Hadzilacos, and N. Goodman,Conncurrency Control and Recovery in Database Systems, Addison-Wesley: Reading, MA, 1987.

    Google Scholar 

  8. S. Biyabani, J.A. Stankovic, and K. Ramamritham, “The integration of deadline and criticalness in hard real-time scheduling,” inProc. Real-Time Systems Symp., 1988.

  9. A.P. Buchmann, D.R. McCarthy, M. Chu, and U. Dayal, “Time-critical database scheduling: a framework for integrating real-time scheduling and concurrency control,” inProc. Conf. Data Engineering, 1989.

  10. M.J. Carey, R. Jauhari, and M. Livny, “Priority in DBMS resource scheduling,” inProc. 15th VLDB Conf., 1990, pp. 397–410.

  11. S. Chen, J. Stankovic, J. Kurose, and D. Towsley, “Performance evaluation of two new disk scheduling algorithms for real-time systems,”Real-Time Systems, vol. 3, no. 3, pp. 307–336, Sept. 1991.

    Google Scholar 

  12. U. Dayal et al., “The HiPAC project: combining active databases and timing constraints,”SIGMOD Record, vol. 17, pp. 51–70, 1988.

    Google Scholar 

  13. K.R. Dittrich and U. Dayal, “Active database systems” (tutorial notes), inseventeenth Int. Conf. Very Large Databases, 1991.

  14. K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, “The notion of consistency, and predicate locks in a database system,”Comm. ACM, vol. 19(11), pp. 624–633, 1976.

    Google Scholar 

  15. Peter A. Franaszek, John T. Robinson, and Alexander Thomasian, “Access invariance and its use in high contention environments”, inProc. Sixth Int. Conf. Database Engineerinng, 1990, pp. 47–55.

  16. M.C. Graham, “Issues in real-time data management,”Real-Time Systems, vol. 4, no. 3, pp. 185–202, Sept. 1992.

    Google Scholar 

  17. J.N. Gray, R.A. Lorie, G.R. Putzulo, and I.L. Traiger, “Granularity of locks and degress of consistency in a shared database,” inProc. First Int. Conf. Very Large Databases, Framingham, MA, 1975, pp. 25–33.

  18. J.N. Gray and A. Reuter,Transaction processing: techniques and concepts, Morgan Kaufman, 1992.

  19. N. Griffeth and A. Weinrib, “Scalability of a real-time distributed resource counter”, inProc. Real-Time Systems Symp., Orlando, 1990.

  20. J.R. Haritsa, M.J. Carey and M. Livny, “On being optimistic about real-time constraints,” inProc. ACM PODS, 1990.

  21. J.R. Haritsa, M.J. Carey, and M. Livny, “Dynamic real-time optimistic concurrency control,” inProc. Real-Time Systems Symp., 1990.

  22. J.R. Haritsa, M.J. Carey, and M. Livny, “Earliest deadline scheduling for real-time database systems,” inProc. Real-Time Systems Symp., 1991.

  23. W. Hou, G. Ozsoyoglu, and B.K. Taneja, “Processing aggregate relational queries with hard time constraints,” inProc. ACM SIGMOD Int. Conf. Management of Data, 1989.

  24. J. Huang and J. Stankovic, “Real-time buffer management,” in COINS TR 90–65, 1990.

  25. J. Huang, J.A. Stankovic, K. Ramamritham, and D. Towsley, “Experimental evaluation of real-time optimistic concurrency control schemes,” inProc. Conf. Very Large Data Bases, 1991.

  26. J. Huang, J.A. Stankovic, K. Ramamritham, and D. Towsley, “On using priority inheritance in real-time databases,” inProc. Real-Time Systems Symp., 1991.

  27. J. Huang, J.A. Stankovic, D. Towsley, and K. Ramamritham, “Experimental evaluation of real-time transaction processing,” inProc. Real-Time Systems Symp., 1989.

  28. E.D. Jensen, C.D. Locke, and H. Tokuda, “A time-driven scheduling model for real-time operating systems,” inProc. 1985 IEEE Real-Time Systems Symp., pp. 112–122.

  29. W. Kim and J. Srivastava, “Enhancing real-time DBMS performance with multiversion data and priority-based disk scheduling,” inProc. Real-Time Systems Symp., 1991, pp. 222–231.

  30. G. Koren and D. Shasha, “D-Over: an optimal on-line scheduling algorithm for overloaded real-time systems,” inReal-Time Systems Symp., 1992.

  31. H.F. Korth, E. Levy, and A. Silberschatz, “Compensating transactions: a new recovery paradigm,” inProc. Sixteenth Int. Conf. Very Large Databases, Brisbane, Australia, 1990, pp. 95–106.

  32. H.F. Korth, N. Soparkar, A. Silberschatz, “Triggered real-time databases with consistency constraints,” with consistency constraints,” inProc. Conf. Very Large Data Bases, 1990.

  33. Y. Lin and S.H. Son, “Concurrenncy control in real-time databases by dynamic adjustment of serialization order,” inProc. Real-Time Systems Symp., 1990.

  34. J. Liu, K. Lin, W. Shih, A. Yu, J. Chung, and W. Zhao, “Algorithms for scheduling imprecise computation,”IEEE Comput., vol. 24, no. 5, 1991.

    Google Scholar 

  35. J.E.B. Moss, “Nested transactions: an approach to reliable distributed computing,” Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1981.

    Google Scholar 

  36. P. O'Neil, K. Ramamritham, and C. Pu, “Towards predictable transaction executions in real-time database systems,” Technical Report 92–35, University of Massachusetts, 1992.

  37. C. Pu and A. Leff, “Replica control in distributed systems: an asynchronous approach,” inProc. ACM SIGMOD Int. Conf. Management of Data, 1991, pp. 377–386.

  38. K. Ramamritham and P. Chrysanthis, “In search of acceptability criteria: database consistency requirements and transaction correctness properties,” inDistributed Object Management, T. Ozsu, Dayal, and P. Valduriez (Eds.), Morgan Kaufmann, 1992.

  39. K. Ramamritham, S. Son, A. Buchmann, K. Dittrich, and C. Mohan, “Real-time databases,” panel statement,Proc. Conf. Very-Large Databases, 1991.

  40. K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient scheduling algorithms for real-time multiprocessor systems,”IEEE Trans. Parallel Distrib Systems, vol. 1, no. 2, pp. 184–194, 1990.

    Google Scholar 

  41. L. Sha, R. Rajkumar, and J. Lehoczky, “Priority inheritance protocols: an approach to real-time synchronization,”IEEE Trans. Comput., 39, pp. 1175–1185, 1990.

    Google Scholar 

  42. L. Sha, R. Rajkumar, and J.P. Lehoczky, “Concurrency control for distributed real-time databases,”ACM SIGMOD Record, vol. 17, no. 1, pp. 82–98, March 1988.

    Google Scholar 

  43. C. Shen, K. Ramamritham, and J. Stankovic, “Resource reclaiming in real-time,” inProc. Real-Time System Symp. 1990. (To appear in)IEEE Trans. parallel Distrib. Systems, March 1993.

  44. K.P. Smith and J.W.S. Liu, “Monotonically improving approximate answers to relational algebra queries,”Proc. Compsac, 1989.

  45. R. Snodgrass and I. Ahn, “Temporal databases,”IEEE Comput., vol. 19, no. 9, pp. 35–42, 1986.

    Google Scholar 

  46. S. H. Son, Y. Lin, and R.P. Cook “Concurrency control in real-time databases systems,” inFoundationns of Real-time Computing: Scheduling and Resource Management, Andre van Tilborg and Gary Koob, (eds.), Kluwer 1991, pp. 185–202.

  47. X. Song and J.W.S. Liu, “How well can data temporal consistency be maintained?” inProc. IEEE Symp. Computer-Aided Control Systems Design, pp. 275–284, March 1992.

  48. J.A. Stankovic, K. Ramamritham, and D. Towsley, “Scheduling in real-time transaction systems,” in Andre van Tilborg and Gray Koob, (eds.),Foundations of Real-Time Computing: Scheduling and Resource Management, 1991, pp. 157–184.

  49. Y.C. Tay, Nathan Goodman, and Rajan Suri, “Locking performance in centralized databases,”ACM Trans. Database System, vol. 10, 4, pp. 415–462, 1985.

    Google Scholar 

  50. S. V. Vrbsky and K.J. Lin, “Recovering imprecise computations with real-time constraints,” inProc. Seventh Symp. Reliable Distributed Systems, 1988, pp. 185–193.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Massachusetts, 01003, Amherst, MA

    Krithi Ramamritham

Authors
  1. Krithi Ramamritham
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramamritham, K. Real-time databases. Distrib Parallel Databases 1, 199–226 (1993). https://doi.org/10.1007/BF01264051

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01264051

Keywords

Search

Navigation