{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:10:02Z","timestamp":1750223402017,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"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":[[1987,7]]},"abstract":"<jats:p>The desirability of acyclic database schemes is well argued in [8] and [13]. For schemas described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand sides and do not form intersection anomalies. In a recent work [4] it is argued that real-world database schemes always meet the former requirement, and in [5] it is shown that any given real-world scheme can be made to satisfy also the latter requirement, after being properly extended. However, the method of elimination of intersection anomalies proposed in [5] is intrinsically nondeterministic\u2014an undesirable property for a design tool. In the present work it is shown that this nondeterminism does not, however, affect the final result of the design process. In addition, we present an efficient deterministic algorithm, which is equivalent to the nondeterministic process of [5]. Along the way a study of intersection anomalies, which is interesting in its own right, is performed.<\/jats:p>","DOI":"10.1145\/28869.28872","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:25:57Z","timestamp":1027769157000},"page":"544-577","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A theory of intersection anomalies in relational database schemes"],"prefix":"10.1145","volume":"34","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":[[1987,7]]},"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","doi-asserted-by":"publisher","DOI":"10.1145\/5922.214291"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5927"},{"key":"e_1_2_1_6_2","first-page":"113","volume-title":"Proceedings of the 4th 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 4th International Conference on Very Large Data Bases ( West Berlin, Germany, Sept. 13-15). ACM, New York , 1978 , pp. 113 - 124 . BEERI, C., BERNSTEIN, P. A., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. In Proceedings of the 4th International Conference on Very Large Data Bases (West Berlin, Germany, Sept. 13-15). ACM, New York, 1978, pp. 113-124."},{"key":"e_1_2_1_7_2","first-page":"47","volume-title":"Proceedings of the A CM-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 m ultivalued dependencies in database relations . In Proceedings of the A CM-SIGMOD International Conference on Management of Data ( Toronto, Ont., Canada, Aug. 3-5). ACM, New York , 1977 , pp. 47 - 46 I. 10.1145\/509404.509414 BEERI, C., FAGIN, R., AND HOWARD, J. H. A complete axiomatization for functional and m ultivalued dependencies in database relations. In Proceedings of the A CM-SIGMOD International Conference on Management of Data (Toronto, Ont., Canada, Aug. 3-5). ACM, New York, 1977, pp. 47-6 I. 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\/319732.319735"},{"key":"e_1_2_1_11_2","first-page":"40","volume-title":"Proceedings of the ACM Symposium on Principles of Database Systems","author":"GOODMAN N.","year":"1982","unstructured":"GOODMAN , N. , AND SHMUELI , O. The tree property is fundamental for query processing . In Proceedings of the ACM Symposium on Principles of Database Systems ( Los Angeles, Calif., Mar. 29-31). ACM, New York , 1982 , 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 on Principles of Database Systems (Los Angeles, Calif., Mar. 29-31). ACM, New York, 1982, 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","author":"MAIER D.","year":"1982","unstructured":"MAIER , D. , AND ULLMAN , J.D. Connections in acyclic hypergraphs . In Proceedings of the ACM Symposium on Principles of Database Systems ( Los Angeles, Calif., Mar. 29-31). ACM, New York , 1982 , 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 (Los Angeles, Calif., Mar. 29-31). ACM, New York, 1982, pp. 34-39. 10.1145\/588111.588118"},{"key":"e_1_2_1_15_2","volume-title":"SUNY at Stony Brook","author":"SC ORE","year":"1980","unstructured":"SC l ORE , E. Real-World MVD s. Tech. Rep. 80\/014. Dept. of Computer Science , SUNY at Stony Brook , Nov. 1980 . SClORE, E. Real-World MVDs. Tech. Rep. 80\/014. Dept. of Computer Science, SUNY at Stony Brook, 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, Rockville , Md ., 1982 . ULLMAN, J.D. Principles of Database Systems. Computer Science Press, Rockville, Md., 1982."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/28869.28872","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/28869.28872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:51Z","timestamp":1750221531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/28869.28872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,7]]}},"alternative-id":["10.1145\/28869.28872"],"URL":"https:\/\/doi.org\/10.1145\/28869.28872","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[1987,7]]},"assertion":[{"value":"1987-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}