DBScholar

Back to papers

On Being Optimistic about Real-Time Constraints

Summary: Re-evaluates optimistic vs. locking concurrency control in real-time DBs, showing that policy for missed deadlines (deadline‑drop), knowledge of transaction resource needs, and resource availability critically alter relative performance. Demonstrates that under deadline‑discard policies optimistic CC outperforms locking across a wide range of utilizations and argues why optimistic methods align well with RT scheduling semantics. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
911
Venue
PODS
Year
1990
Pagerank
7.0490378e-05
Overall Rank
3,882 | 73.37%
DOI
10.1145/298514.298585

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{haritsa_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{On Being Optimistic about Real-Time Constraints}},
        url = {https://dl.acm.org/doi/10.1145/298514.298585},
        doi = {10.1145/298514.298585},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Haritsa, Jayant R. and Carey, Michael J. and Livny, Miron},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers