Loading…
Maintaining state constraints in relational databases: a proof theoretic basis
If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure that it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint C...
Saved in:
| Published in: | Journal of the ACM 1989, Vol.36 (1), p.46-68 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343 |
| container_end_page | 68 |
| container_issue | 1 |
| container_start_page | 46 |
| container_title | Journal of the ACM |
| container_volume | 36 |
| creator | MCCUNE, W. W HENSCHEN, L. J |
| description | If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure that it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint
C
and a class of updates, and either proves that an update in the class cannot violate
C
, or produces a formula
C'
(a complete test) that is satisfied before the update if and only if
C
would continue to be satisfied were the update to occur.
C'
is frequently much easier to evaluate than
C
. In addition, a formula
D
(a sufficient test) is sometimes produced such that if
D
is satisfied before the update, then
C
would continue to be satisfied were the update to occur. The method is proved correct. The method is substantially more general than other reported techniques for this problem. The method has been implemented, and a number of experiments with the implementation are presented. |
| doi_str_mv | 10.1145/58562.59302 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1808079390</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808079390</sourcerecordid><originalsourceid>FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343</originalsourceid><addsrcrecordid>eNo9kElLBDEQhYMoOI6e_AM5eBCkxyydTtqbDG4w6kXBW1OdRSM93WMqc_Df27PgoSiq6tXj8RFyztmM81JdK6MqMVO1ZOKATLhSutBSfRySCWOsLFTJ-TE5QfweRyaYnpCXZ4h9Hiv2nxQzZE_t0GNOmzXS2NPkO8hx6KGjDjK0gB5vKNBVGoZA85cfks_R0vEQ8ZQcBejQn-37lLzf373NH4vF68PT_HZRWClZLnwroA5jBA7Wuda4IEIrtJUuGCfqqvJtxY1TwWqnHG81Ay7Aa2BtzSpZyim53PmOKX7WHnOzjGh910HvhzU23DDDdC1rNkqvdlKbBsTkQ7NKcQnpt-Gs2VBrttSaLbVRfbE3BrTQhQS9jfj_okVtamPkH_LvbO0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1808079390</pqid></control><display><type>article</type><title>Maintaining state constraints in relational databases: a proof theoretic basis</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>MCCUNE, W. W ; HENSCHEN, L. J</creator><creatorcontrib>MCCUNE, W. W ; HENSCHEN, L. J</creatorcontrib><description>If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure that it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint
C
and a class of updates, and either proves that an update in the class cannot violate
C
, or produces a formula
C'
(a complete test) that is satisfied before the update if and only if
C
would continue to be satisfied were the update to occur.
C'
is frequently much easier to evaluate than
C
. In addition, a formula
D
(a sufficient test) is sometimes produced such that if
D
is satisfied before the update, then
C
would continue to be satisfied were the update to occur. The method is proved correct. The method is substantially more general than other reported techniques for this problem. The method has been implemented, and a number of experiments with the implementation are presented.</description><identifier>ISSN: 0004-5411</identifier><identifier>EISSN: 1557-735X</identifier><identifier>DOI: 10.1145/58562.59302</identifier><identifier>CODEN: JACOAH</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Integrity ; Memory organisation. Data processing ; Relational data bases ; Software</subject><ispartof>Journal of the ACM, 1989, Vol.36 (1), p.46-68</ispartof><rights>1989 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343</citedby><cites>FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=7298988$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>MCCUNE, W. W</creatorcontrib><creatorcontrib>HENSCHEN, L. J</creatorcontrib><title>Maintaining state constraints in relational databases: a proof theoretic basis</title><title>Journal of the ACM</title><description>If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure that it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint
C
and a class of updates, and either proves that an update in the class cannot violate
C
, or produces a formula
C'
(a complete test) that is satisfied before the update if and only if
C
would continue to be satisfied were the update to occur.
C'
is frequently much easier to evaluate than
C
. In addition, a formula
D
(a sufficient test) is sometimes produced such that if
D
is satisfied before the update, then
C
would continue to be satisfied were the update to occur. The method is proved correct. The method is substantially more general than other reported techniques for this problem. The method has been implemented, and a number of experiments with the implementation are presented.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Integrity</subject><subject>Memory organisation. Data processing</subject><subject>Relational data bases</subject><subject>Software</subject><issn>0004-5411</issn><issn>1557-735X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNo9kElLBDEQhYMoOI6e_AM5eBCkxyydTtqbDG4w6kXBW1OdRSM93WMqc_Df27PgoSiq6tXj8RFyztmM81JdK6MqMVO1ZOKATLhSutBSfRySCWOsLFTJ-TE5QfweRyaYnpCXZ4h9Hiv2nxQzZE_t0GNOmzXS2NPkO8hx6KGjDjK0gB5vKNBVGoZA85cfks_R0vEQ8ZQcBejQn-37lLzf373NH4vF68PT_HZRWClZLnwroA5jBA7Wuda4IEIrtJUuGCfqqvJtxY1TwWqnHG81Ay7Aa2BtzSpZyim53PmOKX7WHnOzjGh910HvhzU23DDDdC1rNkqvdlKbBsTkQ7NKcQnpt-Gs2VBrttSaLbVRfbE3BrTQhQS9jfj_okVtamPkH_LvbO0</recordid><startdate>1989</startdate><enddate>1989</enddate><creator>MCCUNE, W. W</creator><creator>HENSCHEN, L. J</creator><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1989</creationdate><title>Maintaining state constraints in relational databases: a proof theoretic basis</title><author>MCCUNE, W. W ; HENSCHEN, L. J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Integrity</topic><topic>Memory organisation. Data processing</topic><topic>Relational data bases</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>MCCUNE, W. W</creatorcontrib><creatorcontrib>HENSCHEN, L. J</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of the ACM</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>MCCUNE, W. W</au><au>HENSCHEN, L. J</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Maintaining state constraints in relational databases: a proof theoretic basis</atitle><jtitle>Journal of the ACM</jtitle><date>1989</date><risdate>1989</risdate><volume>36</volume><issue>1</issue><spage>46</spage><epage>68</epage><pages>46-68</pages><issn>0004-5411</issn><eissn>1557-735X</eissn><coden>JACOAH</coden><abstract>If a relational database is required to satisfy a set of integrity constraints, then when the database is updated, one must ensure that it continues to satisfy the constraints. It is desirable not to have to evaluate each constraint after each update. A method is described that takes a constraint
C
and a class of updates, and either proves that an update in the class cannot violate
C
, or produces a formula
C'
(a complete test) that is satisfied before the update if and only if
C
would continue to be satisfied were the update to occur.
C'
is frequently much easier to evaluate than
C
. In addition, a formula
D
(a sufficient test) is sometimes produced such that if
D
is satisfied before the update, then
C
would continue to be satisfied were the update to occur. The method is proved correct. The method is substantially more general than other reported techniques for this problem. The method has been implemented, and a number of experiments with the implementation are presented.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/58562.59302</doi><tpages>23</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0004-5411 |
| ispartof | Journal of the ACM, 1989, Vol.36 (1), p.46-68 |
| issn | 0004-5411 1557-735X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1808079390 |
| source | Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list) |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Information systems. Data bases Integrity Memory organisation. Data processing Relational data bases Software |
| title | Maintaining state constraints in relational databases: a proof theoretic basis |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T06%3A23%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Maintaining%20state%20constraints%20in%20relational%20databases:%20a%20proof%20theoretic%20basis&rft.jtitle=Journal%20of%20the%20ACM&rft.au=MCCUNE,%20W.%20W&rft.date=1989&rft.volume=36&rft.issue=1&rft.spage=46&rft.epage=68&rft.pages=46-68&rft.issn=0004-5411&rft.eissn=1557-735X&rft.coden=JACOAH&rft_id=info:doi/10.1145/58562.59302&rft_dat=%3Cproquest_cross%3E1808079390%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c330t-eb2a9f0021acddb8df2fb27c3df8d2966eb618d5fc7d5d1b70a12ae7a0b906343%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1808079390&rft_id=info:pmid/&rfr_iscdi=true |