Robustness against Read Committed for Transaction Templates with Functional Constraints
The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining serializability at the lower cost of RC. Such workloads are said to be...
Uloženo v:
| Vydáno v: | Logical methods in computer science Ročník 19, Issue 4 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Logical Methods in Computer Science e.V
25.12.2023
|
| Témata: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The popular isolation level Multiversion Read Committed (RC) trades some of
the strong guarantees of serializability for increased transaction throughput.
Sometimes, transaction workloads can be safely executed under RC obtaining
serializability at the lower cost of RC. Such workloads are said to be robust
against RC. Previous work has yielded a tractable procedure for deciding
robustness against RC for workloads generated by transaction programs modeled
as transaction templates. An important insight of that work is that, by more
accurately modeling transaction programs, we are able to recognize larger sets
of workloads as robust. In this work, we increase the modeling power of
transaction templates by extending them with functional constraints, which are
useful for capturing data dependencies like foreign keys. We show that the
incorporation of functional constraints can identify more workloads as robust
that otherwise would not be. Even though we establish that the robustness
problem becomes undecidable in its most general form, we show that various
restrictions on functional constraints lead to decidable and even tractable
fragments that can be used to model and test for robustness against RC for
realistic scenarios. |
|---|---|
| ISSN: | 1860-5974 1860-5974 |
| DOI: | 10.46298/lmcs-19(4:39)2023 |