{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:30:52Z","timestamp":1787340652227,"version":"build-2736575974"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,5]]},"abstract":"<jats:p>Recently, the representative instance has been proposed as a generalized concept of the pure universal relation. Let ${\\bf R} = \\{ \\langle R_1 ,F_1 \\rangle , \\cdots , \\langle R_n ,F_n \\rangle \\}$ be a database scheme, where each $R_i $ is a set of attributes and $F_i $ is a set of functional dependencies over $R_i $. ${\\bf R}$ is said to be consistent if the representative instance of every database $I = \\{ r_1 , \\cdots ,r_n \\}$ of ${\\bf R}$ satisfies $F (= F_1 \\cup \\cdots \\cup F_n )$, that is, if whenever each relation $r_i $ satisfies its own functional dependencies $F_i $, the representative instance satisfies all the functional dependencies F. In this paper, we present the following two results, which are generalizations of the previous results by [Sag2].<\/jats:p>\n                  <jats:p>(1) It can be determined in $O(n|F|\\|F\\|)$ time whether ${\\bf R}$ is consistent, where $|F|$ is the number of functional dependencies in F and $||F||$ is the size of the description of F. (A polynomial time algorithm for determining whether ${\\bf R}$ is consistent is presented, independently, in [GY].)<\/jats:p>\n                  <jats:p>(2) Suppose that ${\\bf R}$ is consistent. Given a subset V of $R_1 \\cup \\cdots \\cup R_n $, we can construct in $O(n|F|\\|F\\|)$ time a relational expression such that (a) its value is the total projection of the representative instance onto V for every database of ${\\bf R}$, (b) it consists of projection, extension join, and union, and (c) it contains neither a redundant union nor a redundant join.<\/jats:p>","DOI":"10.1137\/0214026","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"334-354","source":"Crossref","is-referenced-by-count":23,"title":["Some Results on the Representative Instance in Relational Databases"],"prefix":"10.1137","volume":"14","author":[{"given":"Minoru","family":"Ito","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Motoaki","family":"Iwasaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tadao","family":"Kasami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RABU","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320091"},{"key":"RARM","first-page":"580","volume-title":"Information processing 74 (Proc. IFIP Congress, Stockholm, 1974)","author":"Armstrong W. W.","year":"1974"},{"key":"RBB","doi-asserted-by":"publisher","DOI":"10.1145\/320064.320066"},{"key":"RCOD1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"RCOD2","volume-title":"Data Base Systems","author":"Codd E. F.","year":"1972"},{"key":"RGY","doi-asserted-by":"crossref","unstructured":"M. H. Graham, M. Yannakakis,  Independent database schemas (extended abstract),  Proc. ACM Symposium on Principles of Database Systems,  1982,  199\u2013204, March","DOI":"10.1145\/588111.588144"},{"key":"RHON1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322330"},{"key":"RHON2","unstructured":"P. Honeyman,  Extension joins,  Proc. Int. Conf. Very Large Data Bases,  1980,  239\u2013244"},{"key":"RIIK","unstructured":"M. Iwasaki, M. Ito, T. Kasami,  A result on the representative instance in relational databases,  1982, Tech. Rep. of Languages and Automata Symposium, Kyoto Feb. (In Japanese)"},{"key":"RKEN","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319630"},{"key":"RMMS","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"RMUV","unstructured":"D. Maier, J. D. Ullman, M. Y. Vardi,  On the foundations of the universal relation model, unpublished manuscript"},{"key":"RSAG1","doi-asserted-by":"crossref","unstructured":"Y. Sagiv,  Can we use the universal instance assumption without using nulls?  Proc. ACM SIGMOD International Conference on Management of Data,  1981,  108\u2013120, April","DOI":"10.1145\/582318.582336"},{"key":"RSAG2","doi-asserted-by":"publisher","DOI":"10.1145\/319983.319988"},{"key":"RVAS","unstructured":"Y. Vassiliou,  A formal treatment of imperfect information in database management, TR CSRG-123, Univ. Toronto, Toronto, Ontario,  1980"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:46Z","timestamp":1787337766000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["10.1137\/0214026"],"URL":"https:\/\/doi.org\/10.1137\/0214026","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}