{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T06:31:25Z","timestamp":1791181885879,"version":"4.1.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2009,6,24]],"date-time":"2009-06-24T00:00:00Z","timestamp":1245801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2009,6,24]]},"abstract":"<jats:p>The large, integrated data banks of the future will contain many relations of various degrees in stored form. It will not be unusual for this set of stored relations to be redundant. Two types of redundancy are defined and discussed. One type may be employed to improve accessibility of certain kinds of information which happen to be in great demand. When either type of redundancy exists, those responsible for control of the data bank should know about it and have some means of detecting any \"logical\" inconsistencies in the total set of stored relations. Consistency checking might be helpful in tracking down unauthorized (and possibly fraudulent) changes in the data bank contents.<\/jats:p>","DOI":"10.1145\/1558334.1558336","type":"journal-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:17Z","timestamp":1246367417000},"page":"17-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Derivability, redundancy and consistency of relations stored in large data banks"],"prefix":"10.1145","volume":"38","author":[{"given":"E. F.","family":"E, F. Codd","sequence":"first","affiliation":[{"name":"Research Division, San Jose, California"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,24]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"C.W. Bachman YSoftware for Random Access Processing \" Datamation April 1965.  C.W. Bachman YSoftware for Random Access Processing \" Datamation April 1965."},{"key":"e_1_2_1_2_1","first-page":"13","volume":"5","author":"McGee","journal-title":"Annual Review in Automatic Programming"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465611.1465682"},{"key":"e_1_2_1_4_1","unstructured":"A. Church \"An Introduction to Mathematical Logic I \" Princeton 1956.  A. Church \"An Introduction to Mathematical Logic I \" Princeton 1956."}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1558334.1558336","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1558334.1558336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:56Z","timestamp":1750253396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1558334.1558336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,24]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,6,24]]}},"alternative-id":["10.1145\/1558334.1558336"],"URL":"https:\/\/doi.org\/10.1145\/1558334.1558336","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2009,6,24]]},"assertion":[{"value":"2009-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}