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žené v:
| Vydané v: | Logical methods in computer science Ročník 19, Issue 4 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Logical Methods in Computer Science e.V
25.12.2023
|
| Predmet: | |
| ISSN: | 1860-5974, 1860-5974 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. 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. |
| Author | Koch, Christoph Neven, Frank Vandevoort, Brecht Ketsman, Bas |
| Author_xml | – sequence: 1 givenname: Brecht surname: Vandevoort fullname: Vandevoort, Brecht – sequence: 2 givenname: Bas surname: Ketsman fullname: Ketsman, Bas – sequence: 3 givenname: Christoph surname: Koch fullname: Koch, Christoph – sequence: 4 givenname: Frank surname: Neven fullname: Neven, Frank |
| BookMark | eNpNkE1LAzEQhoMoWGv_gKc96mE1n5uNNylWhYJQKh5DNpnULbubkkTEf--2FXEuM7zwPgPPBTodwgAIXRF8yyuq6ruut6kk6prfM3VDMWUnaELqCpdCSX767z5Hs5S2eBzGSE2rCXpfheYz5QFSKszGtEPKxQqMK-ah79ucwRU-xGIdzZCMzW0YijX0u85kSMVXmz-KxedwyE03dsZ6HCE5XaIzb7oEs989RW-Lx_X8uVy-Pr3MH5alpZSx0jsQ2BhsK-Z9hYUkIBT1rLFYMUYlV9xLLCpHGgm-bqygiisihfINd7VjU_Ry5LpgtnoX297Ebx1Mqw9BiBttYm5tBxoaLoUDMz4AXjPScCE4x9JD7YwAOrLokWVjSCmC_-MRrA-m9d60JkpzzZTem2Y_qvF1Cw |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/lmcs-19(4:39)2023 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_eb475dea592e4831b4554407fe8da5e2 10_46298_lmcs_19_4_39_2023 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c2233-fde50aa0c63ff60571e592f3bc093327494f7056d1b7ef8bc529491759fb4d8d3 |
| IEDL.DBID | DOA |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:44:01 EDT 2025 Sat Nov 29 06:21:52 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2233-fde50aa0c63ff60571e592f3bc093327494f7056d1b7ef8bc529491759fb4d8d3 |
| OpenAccessLink | https://doaj.org/article/eb475dea592e4831b4554407fe8da5e2 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_eb475dea592e4831b4554407fe8da5e2 crossref_primary_10_46298_lmcs_19_4_39_2023 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-12-25 |
| PublicationDateYYYYMMDD | 2023-12-25 |
| PublicationDate_xml | – month: 12 year: 2023 text: 2023-12-25 day: 25 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2023 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.2905269 |
| Snippet | The popular isolation level Multiversion Read Committed (RC) trades some of
the strong guarantees of serializability for increased transaction throughput.... The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput.... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - databases computer science - logic in computer science |
| Title | Robustness against Read Committed for Transaction Templates with Functional Constraints |
| URI | https://doaj.org/article/eb475dea592e4831b4554407fe8da5e2 |
| Volume | 19, Issue 4 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxcDCN6J8yQMDCEVtYjuJ2QC1YqFCqIhulh2fUaV-qUkZ-e2cnRbKxMKSIUoi6zm-e8863yPkMgGdgZAGF5KGiHOXRToNB4EzcEbEzoALZhNZr5cPBvJ5zerL14TV7YFr4FpgeCYsaCET4DmLDccEiCrEQW61gBB9kfWsiakQgxnzxLk-JcPTROat0bgoo1he8Vsmr71p-K9MtNawP2SW7i7ZXlJCelcPZY9swGSf7KzsFuhy9R2Qt5epWZSVj01Uv6OiLyvqa-CpP-QxrJA6UmSgtP_jAE77MJ6NPJukfr-VdjGJ1Xt_1Bt1BnuIqjwkr91O_-ExWvoiRAUmcxY5C6KtdbtImXMoR7IY0U4cM4XfnkCZKRFyJDY2Ngh4bgqRSI6yTEhnuM0tOyKNyXQCx4QaSCy0pQWUYfiaNUxYpBTImdJCOMma5GaFkZrV7S8UyoaAqPKIqlgqrphUHtEmufcwfj_pW1eHGzihajmh6q8JPfmPj5ySLT8gX3eSiDPSqOYLOCebxUc1LOcX4V_B69Nn5wuaEMZl |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Robustness+against+Read+Committed+for+Transaction+Templates+with+Functional+Constraints&rft.jtitle=Logical+methods+in+computer+science&rft.au=Vandevoort%2C+Brecht&rft.au=Ketsman%2C+Bas&rft.au=Koch%2C+Christoph&rft.au=Neven%2C+Frank&rft.date=2023-12-25&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=19%2C+Issue+4&rft_id=info:doi/10.46298%2Flmcs-19%284%3A39%292023&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_19_4_39_2023 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |