ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

On Being Optimistic about Real-Time Constraints.

Jayant R. Haritsa, Michael J. Carey, Miron Livny: On Being Optimistic about Real-Time Constraints. PODS 1990: 331-343
@inproceedings{DBLP:conf/pods/HaritsaCL90,
  author    = {Jayant R. Haritsa and
               Michael J. Carey and
               Miron Livny},
  title     = {On Being Optimistic about Real-Time Constraints},
  booktitle = {Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on
               Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee},
  publisher = {ACM Press},
  year      = {1990},
  isbn      = {0-89791-352-3},
  pages     = {331-343},
  ee        = {http://doi.acm.org/10.1145/298514.298585, db/conf/pods/HaritsaCL90.html},
  crossref  = {DBLP:conf/pods/90},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Performance studies of concurrency control algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic techniques. Real-time database systems have special characteristics - timing constraints are associated with transactions, performance criteria are based on satisfaction of these timing constraints, and scheduling algorithms are priority driven. In light of these special characteristics, results regarding the performance of concurrency control algorithms need to be re-evaluated. We show in this paper that the following parameters of the real-time database system - its policy for dealing with transactions whose constraints are not met, its knowledge of transaction resource requirements, and the availability of resources - have a significant impact on the relative performance of the concurrency control algorithms. In particular, we demonstrate that under a policy that discards transactions whose constraints are not met, optimistic concurrency control outperforms locking over a wide range of system utilization. We also outline why, for a variety of reasons, optimistic algorithms appear well-suited to real-time database systems.

Copyright © 1990 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98. and ... Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings. and ...

Printed Edition

Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee. ACM Press 1990, ISBN 0-89791-352-3
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Online Edition: ACM Digital Library


References

[Abbo88]
Robert K. Abbott, Hector Garcia-Molina: Scheduling Real-time Transactions: a Performance Evaluation. VLDB 1988: 1-12 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Abbo89]
Robert K. Abbott, Hector Garcia-Molina: Scheduling Real-Time Transactions with Disk Resident Data. VLDB 1989: 385-396 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Agra87]
Rakesh Agrawal, Michael J. Carey, Miron Livny: Concurrency Control Performance Modeling: Alternatives and Implications. ACM Trans. Database Syst. 12(4): 609-654(1987) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Care88]
Michael J. Carey, Miron Livny: Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication. VLDB 1988: 13-25 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Care89]
Michael J. Carey, Rajiv Jauhari, Miron Livny: Priority in DBMS Resource Scheduling. VLDB 1989: 397-410 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Eswa76]
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Kung81]
H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Livn88]
...
[Mena82]
Daniel A. Menascé, Tatuo Nakanishi: Optimistic versus pessimistic concurrency control mechanisms in database management systems. Inf. Syst. 7(1): 13-27(1982) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Robi82]
...
[Sha87]
...
[Jack63]
...
[Klei75]
...

Referenced by

  1. Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam: Real-Time Data Access Control on B-Tree Index Structures. ICDE 1999: 458-467
  2. Divyakant Agrawal, Amr El Abbadi, Richard Jeffers, Lijing Lin: Ordered Shared Locks for Real-Time Databases. VLDB J. 4(1): 87-126(1995)
  3. Dennis Shasha, François Llirbat, Eric Simon, Patrick Valduriez: Transaction Chopping: Algorithms and Performance Studies. ACM Trans. Database Syst. 20(3): 325-363(1995)
  4. Xiohui Song, Jane W.-S. Liu: Maintaining Temporal Consistency: Pessimistic vs. Optimitic Concurrency Control. IEEE Trans. Knowl. Data Eng. 7(5): 786-796(1995)
  5. HweeHwa Pang, Michael J. Carey, Miron Livny: Multiclass Query Scheduling in Real-Time Database Systems. IEEE Trans. Knowl. Data Eng. 7(4): 533-551(1995)
  6. Gultekin Özsoyoglu, Richard T. Snodgrass: Temporal and Real-Time Databases: A Survey. IEEE Trans. Knowl. Data Eng. 7(4): 513-532(1995)
  7. Azer Bestavros, Spyridon Braoudakis: Value-cognizant Speculative Concurrency Control. VLDB 1995: 122-133
  8. Seok-Hee Hong, Yoon-Joon Lee, Myoung-Ho Kim: Real-Time Multiversion Concurrency Control Using Precedence Relationship. DASFAA 1995: 222-229
  9. Piotr Krzyzagórski, Tadeusz Morzy: Optimistic Concurrency Control Algorithm with Dynamic Serialization Adjustment for Firm Deadline Real-Time Database Systems. ADBIS 1995: 27-42
  10. HweeHwa Pang, Michael J. Carey, Miron Livny: Managing Memory for Real-Time Queries. SIGMOD Conference 1994: 221-232
  11. Jayant R. Haritsa, Michael J. Carey, Miron Livny: Value-Based Scheduling in Real-Time Database Systems. VLDB J. 2(2): 117-152(1993)
  12. D. Hong, Theodore Johnson, Sharma Chakravarthy: Real-Time Transaction Scheduling: A Cost Conscious Approach. SIGMOD Conference 1993: 197-206
  13. Juhnyoung Lee, Sang Hyuk Son: An Optimistic Concurrency Control Protocol for Real-Time Database Systems. DASFAA 1993: 387-394
  14. Robert K. Abbott, Hector Garcia-Molina: Scheduling Real-Time Transactions: A Performance Evaluation. ACM Trans. Database Syst. 17(3): 513-560(1992)
  15. Divyakant Agrawal, Amr El Abbadi, Richard Jeffers: Using Delayed Commitment in Locking Protocols for Real-Time Databases. SIGMOD Conference 1992: 104-113
  16. Jiandong Huang, John A. Stankovic, Krithi Ramamritham, Donald F. Towsley: Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes. VLDB 1991: 35-46
  17. Hidenori Nakazato, Kwei-Jay Lin: Interval Assignment for Periodic Transactions in Real-Time Database Systems. ICDE 1991: 378-385
  18. Rajiv Jauhari, Michael J. Carey, Miron Livny: Priority-Hints: An Algorithm for Priority-Based Buffer Management. VLDB 1990: 708-721

Copyright © Mon Nov 2 21:04:13 2009 by Michael Ley (ley@uni-trier.de)