{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:38:23Z","timestamp":1787337503783,"version":"build-2736575974"},"reference-count":31,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:p>The weak instance model is a framework for considering the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and updates can be performed for any set of attributes. The management of updates is based on a lattice structure on the set of legal states, and inconsistencies and ambiguities can arise.<\/jats:p>\n                  <jats:p>In the general case, the test for consistency and determinism may involve the whole database. In this paper it is shown how, for the highly significant class of independent schemes, updates can be handled efficiently, considering only the relevant portion of the database.<\/jats:p>","DOI":"10.1137\/s009753979325799x","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1112-1135","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Database Updates with Independent Schemes"],"prefix":"10.1137","volume":"28","author":[{"given":"Riccardo","family":"Torlone","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Atzeni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul,\n                      Updates, a new frontier\n                      , in Second International Conference on Data Base Theory (ICDT\u201988), Bruges, Lecture Notes in Comput. Sci. 326, Springer\u2010Verlag, New York, 1988, pp. 1\u201318.","DOI":"10.1007\/3-540-50171-1_1"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320091"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"P. Atzeni and E. Chan,\n                      Efficient query answering in the representative instance approach\n                      , in Proc. 4th ACM SIGACT SIGMOD Symp. on Principles of Database Systems, Portland, OR, 1985, pp. 181\u2013188.","DOI":"10.1145\/325405.325429"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/63500.63520"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90172-E"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90032-G"},{"key":"R7","unstructured":"P. Atzeni and V. DeAntonellis,\n                      Relational Database Theory: A Comprehensive Introduction\n                      , Benjamin Cummings, Menlo Park, CA, 1993."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Paolo Atzeni, Riccardo Torlone, Solving ambiguities in updating deductive databases, Lecture Notes in Comput. Sci., Vol. 495, Springer, Berlin, 1991, 104\u2013118CMP1119119","DOI":"10.1007\/3-540-54009-1_8"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/146931.146936"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1145\/320064.320066"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/320493.320489"},{"key":"R12","unstructured":"G. Birkhoff,\n                      Lattice Theory\n                      , 3rd ed., Colloq. Publ. XXV, AMS, Providence, RI, 1967."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"E. Chan,\n                      Optimal computation of total projections with unions of simple chase join expressions\n                      , in Proc. ACM SIGMOD International Conf. on Management of Data, Boston, MA, 1984, pp. 149\u2013163.","DOI":"10.1145\/971697.602280"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115362"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/23005.23007"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0216055"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90079-5"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322330"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0214026"},{"key":"R20","first-page":"0","author":"Red\u2019eko V.","year":"1996","journal-title":"Kibernet. Sistem. Anal."},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"R22","unstructured":"D. Maier, D. Rozenshtein, and D. Warren,\n                      Window functions\n                      , in Advances in Computing Research, Vol. 3, P. Kanellakis and F. Preparata, eds., JAI Press, Greenwich, CT, 1986, pp. 213\u2013246."},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1145\/329.318580"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1145\/329.318579"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Y. Sagiv,\n                      Can we use the universal instance assumption without using nulls?\n                      , in Proc. ACM SIGMOD International Conf. on Management of Data, Ann Arbor, MI, 1981, pp. 108\u2013120.","DOI":"10.1145\/582318.582336"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1145\/319983.319988"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Y. Sagiv,\n                      On computing restricted projections of the representative instance\n                      , in Proc. 4th ACM SIGACT SIGMOD Symp. on Principles of Database Systems, Portland, OR, 1985, pp. 173\u2013180.","DOI":"10.1145\/325405.325427"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102787"},{"key":"R29","volume-title":"Fifteenth ACM SIGACT\u2010SIGMOD\u2010SIGART Symposium on Principles of Database Systems","author":"Hull Richard","year":"1999"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1145\/128903.128904"},{"key":"R31","unstructured":"M. Yannakakis,\n                      Querying weak instances\n                      , in Advances in Computing Research, Vol. 3, P. Kanellakis and F. Preparata, eds., JAI Press, Greenwich, CT, 1986, pp. 185\u2013211."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S009753979325799X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:14:21Z","timestamp":1787336061000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S009753979325799X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1137\/S009753979325799X"],"URL":"https:\/\/doi.org\/10.1137\/s009753979325799x","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}