{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:45:53Z","timestamp":1750308353213,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"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":["J. ACM"],"published-print":{"date-parts":[[1986,5]]},"abstract":"<jats:p>\n            The desirability of acyclic (conflict-free) schemes is well argued in [8] and [13]. When a scheme is described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand side and do not form\n            <jats:italic>intersection anomalies<\/jats:italic>\n            . It is shown that if the second condition fails to hold, the scheme can be amended so that it does hold. The basic step is to add one attribute and some dependencies to resolve one intersection anomaly. This step generates an extension of the given scheme in which the anomaly does not exist. Also, the iterative use of the basic step is analyzed and it is proved that the transformation so defined terminates and removes all intersection anomalies.\n          <\/jats:p>","DOI":"10.1145\/5925.5927","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:25:57Z","timestamp":1027769157000},"page":"423-450","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Elimination of intersection anomalies from database schemes"],"prefix":"10.1145","volume":"33","author":[{"given":"Catriel","family":"Beeri","sequence":"first","affiliation":[{"name":"The Hebrew Univ. of Jerusalem, Jerusalem, Israel"}]},{"given":"Michael","family":"Kifer","sequence":"additional","affiliation":[{"name":"State Univ. of New York at Stony Brook, Stony Brook"}]}],"member":"320","published-online":{"date-parts":[[1986,5]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320091"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/320613.320614"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/320064.320066"},{"key":"e_1_2_1_4_2","unstructured":"BEERI C. AND KIFER M. A theory of intersection anomalies in relational database schemes. J. ACM to appear. 10.1145\/28869.28872   BEERI C. AND KIFER M. A theory of intersection anomalies in relational database schemes. J. ACM to appear. 10.1145\/28869.28872"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/5922.214291"},{"key":"e_1_2_1_6_2","first-page":"13","volume-title":"Proceedings of the International Conference on Very Large Data Bases","author":"BEERI C.","year":"1978","unstructured":"BEERI , C. , BERNSTEIN , P. A. , AND GOODMAN , N. A sophisticate's introduction to database normalization theory . In Proceedings of the International Conference on Very Large Data Bases ( West Berlin, Germany). 1978 , pp. I 13 - 124 . BEERI, C., BERNSTEIN, P. A., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. In Proceedings of the International Conference on Very Large Data Bases (West Berlin, Germany). 1978, pp. I 13-124."},{"key":"e_1_2_1_7_2","first-page":"47","volume-title":"Proceedings of the ACM-SIGMOD International Conference on Management of Data","author":"BEERI C.","year":"1977","unstructured":"BEERI , C. , FAGIN , R. , AND HOWARD , J. H. A complete axiomatization for functional and multivaIued dependencies in database relations . In Proceedings of the ACM-SIGMOD International Conference on Management of Data ( Toronto, Ont., Canada, Aug. 3-5). ACM, New York , 1977 , pp. 47 - 61 . 10.1145\/509404.509414 BEERI, C., FAGIN, R., AND HOWARD, J. H. A complete axiomatization for functional and multivaIued dependencies in database relations. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (Toronto, Ont., Canada, Aug. 3-5). ACM, New York, 1977, pp. 47-61. 10.1145\/509404.509414"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/320557.320571"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/319732.319735"},{"key":"e_1_2_1_12_2","first-page":"40","volume-title":"Proceedings of the ACM Symposium of Principles of Database Systems (Mar.). ACM","author":"GOODMAN N.","unstructured":"GOODMAN , N. , AND SHMUELI , O. The tree property is fundamental for query processing . In Proceedings of the ACM Symposium of Principles of Database Systems (Mar.). ACM , New York, 198 l , pp. 40 - 48 . 10.1145\/588111.588119 GOODMAN, N., AND SHMUELI, O. The tree property is fundamental for query processing. In Proceedings of the ACM Symposium of Principles of Database Systems (Mar.). ACM, New York, 198 l, pp. 40-48. 10.1145\/588111.588119"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322311"},{"key":"e_1_2_1_14_2","first-page":"34","volume-title":"Proceedings of the ACM Symposium on Principles of Database Systems (Mar.). ACM","author":"MAIER D.","year":"1981","unstructured":"MAIER , D. , AND ULLMAN , J.D. Connections in acyclic hypergraphs . In Proceedings of the ACM Symposium on Principles of Database Systems (Mar.). ACM , New York , 1981 , pp. 34 - 39 . 10.1145\/588111.588118 MAIER, D., AND ULLMAN, J.D. Connections in acyclic hypergraphs. In Proceedings of the ACM Symposium on Principles of Database Systems (Mar.). ACM, New York, 1981, pp. 34-39. 10.1145\/588111.588118"},{"key":"e_1_2_1_15_2","volume-title":"Stony Brook","author":"SCIORE E.","year":"1980","unstructured":"SCIORE , E. Real-world MVD' s. Tech. Rep. #80\/014, Dept. Comput. Sci. SUNY at Stony Brook , Stony Brook , N.Y. , Nov. 1980 . SCIORE, E. Real-world MVD's. Tech. Rep. #80\/014, Dept. Comput. Sci. SUNY at Stony Brook, Stony Brook, N.Y., Nov. 1980."},{"key":"e_1_2_1_16_2","volume-title":"Principles of Database Systems","author":"ULLMAN J.D.","year":"1982","unstructured":"ULLMAN , J.D. Principles of Database Systems . Computer Science Press, Potomac , Md . 1982 . ULLMAN, J.D. Principles of Database Systems. Computer Science Press, Potomac, Md. 1982."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/5925.5927","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/5925.5927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:43:31Z","timestamp":1750268611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/5925.5927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["10.1145\/5925.5927"],"URL":"https:\/\/doi.org\/10.1145\/5925.5927","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[1986,5]]},"assertion":[{"value":"1986-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}