{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:06:06Z","timestamp":1764173166771},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90141-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"239-265","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Non-finite specifiability of projections of functional dependency families"],"prefix":"10.1016","volume":"39","author":[{"given":"Richard","family":"Hull","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(85)90141-0_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/320083.320091","article-title":"The theory of joins in relational databases","volume":"4","author":"Aho","year":"1979","journal-title":"ACM Trans. Database Systems"},{"issue":"2","key":"10.1016\/0304-3975(85)90141-0_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalences among relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(85)90141-0_BIB3","series-title":"Proc. 1974. IFIP Congress","first-page":"580","article-title":"Dependency structures of database relationships","author":"Armstrong","year":"1974"},{"issue":"1","key":"10.1016\/0304-3975(85)90141-0_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","article-title":"Computational problems related to the design of normal form relational schemes","volume":"4","author":"Beeri","year":"1979","journal-title":"ACM Trans. Database Systems"},{"issue":"1","key":"10.1016\/0304-3975(85)90141-0_BIB5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2422.322414","article-title":"On the structure of Armstrong relations for functional dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0304-3975(85)90141-0_BIB6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/1634.1636","article-title":"A proof procedure for data dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90141-0_BIB7","series-title":"Proc. 8th ICALP","first-page":"73","article-title":"The implication problem for data dependencies","volume":"115","author":"Beeri","year":"1982"},{"key":"10.1016\/0304-3975(85)90141-0_BIB8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/320493.320489","article-title":"Synthesizing third normal form relations from functional dependencies","volume":"1","author":"Bernstein","year":"1976","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0304-3975(85)90141-0_BIB9","first-page":"425","article-title":"Views, authorization and locking in a relational database system","volume":"44","author":"Chamberlin","year":"1975"},{"issue":"6","key":"10.1016\/0304-3975(85)90141-0_BIB10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(85)90141-0_BIB11","series-title":"Data Base Systems","first-page":"33","article-title":"Further normalization of the database relational model","author":"Codd","year":"1972"},{"volume":"Vol. I","year":"1981","author":"Date","key":"10.1016\/0304-3975(85)90141-0_BIB12"},{"key":"10.1016\/0304-3975(85)90141-0_BIB13","series-title":"Proc. ACM SIGMOD Internat. Conf. on the Management of Data","first-page":"119","article-title":"Applying approximate order dependency to reduce indexing space","author":"Dong","year":"1982"},{"issue":"3","key":"10.1016\/0304-3975(85)90141-0_BIB14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/320557.320571","article-title":"Multivalued dependencies and a new normal form for relational databases","volume":"2","author":"Fagin","year":"1977","journal-title":"ACM Trans. Database Systems"},{"issue":"4","key":"10.1016\/0304-3975(85)90141-0_BIB15","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1145\/322344.322347","article-title":"Horn clauses and database dependencies","volume":"29","author":"Fagin","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90141-0_BIB16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(83)90019-1","article-title":"Characterizations for functional dependency and Boyce-Codd normal form families","volume":"26","author":"Ginsburg","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90141-0_BIB17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(83)90084-1","article-title":"Order dependency in the relational model","volume":"26","author":"Ginsburg","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(85)90141-0_BIB18","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1145\/322326.322331","article-title":"Properties of functional-dependency families","volume":"29","author":"Ginsburg","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90141-0_BIB19","series-title":"Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"366","article-title":"Path expressions in databases","author":"Graham","year":"1983"},{"key":"10.1016\/0304-3975(85)90141-0_BIB20","series-title":"Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"177","article-title":"Notions of dependency satisfaction","author":"Graham","year":"1982"},{"issue":"3","key":"10.1016\/0304-3975(85)90141-0_BIB21","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322326.322330","article-title":"Testing satisfaction of functional dependencies","volume":"29","author":"Honeyman","year":"1982","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(85)90141-0_BIB22","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1145\/62.2162","article-title":"Finitely specifiable implicational dependency families","volume":"31","author":"Hull","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90141-0_BIB23","series-title":"Database Design","first-page":"115","article-title":"Semantic database models","author":"King","year":"1985"},{"issue":"4","key":"10.1016\/0304-3975(85)90141-0_BIB24","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/320107.320115","article-title":"Testing implications of data dependencies","volume":"4","author":"Maier","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0304-3975(85)90141-0_BIB25","series-title":"Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"279","article-title":"The revenge of the JD","author":"Maier","year":"1983"},{"key":"10.1016\/0304-3975(85)90141-0_BIB26","unstructured":"J.A. Makowski and M.Y. Vardi, On the expressive power of data dependencies (extended abstract), Unpublished report."},{"year":"1982","series-title":"Data Models","author":"Tsichritzis","key":"10.1016\/0304-3975(85)90141-0_BIB27"},{"year":"1982","series-title":"Principles of Database Systems","author":"Ullman","key":"10.1016\/0304-3975(85)90141-0_BIB28"},{"article-title":"A formal treatment of imperfect information in database management","year":"1980","author":"Vassiliou","key":"10.1016\/0304-3975(85)90141-0_BIB29"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:52Z","timestamp":1553172772000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":29,"alternative-id":["0304397585901410"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90141-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1985]]}}}