{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:15Z","timestamp":1725663675865},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512516"},{"type":"electronic","value":"9783540461821"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51251-9_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:49:16Z","timestamp":1330202956000},"page":"187-206","source":"Crossref","is-referenced-by-count":2,"title":["On the interaction between transitive closure and functional dependencies"],"prefix":"10.1007","author":[{"given":"G.","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Schrefl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Stumptner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R.: \u201cAlpha: An Extension of Relational Algebra to Express a Class of Recursive Queries.\u201d Proc. IEEE 3rd Int. Conf. on Data Engineering, Los Angeles, 1987, pp.580\u2013590.","DOI":"10.1109\/ICDE.1987.7272427"},{"issue":"3","key":"13_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/320083.320091","volume":"4","author":"A.V. Aho","year":"1979","unstructured":"Aho, A.V., C. Beeri, J.D. Ullman: \u201cThe Theory of Joins in Relational Databases.\u201d ACM TODS 4,3 (September 1979), pp.297\u2013314.","journal-title":"ACM TODS"},{"key":"13_CR3","unstructured":"Beeri, C., M.Y.Vardi: \u201cFormal Systems for Tuple and Equality Generating Dependencies.\u201d Hebrew Univ.of Jerusalem Tech. Rep. April 1981."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Casanova, M.A., R. Fagin, C.H. Papadimitriou: \u201cInclusion Dependencies and their interaction with Functional Dependencies.\u201d In: JCSS, 1984, pp. 29\u201359.","DOI":"10.1016\/0022-0000(84)90075-8"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Casanova, M.A. and V.M.P. Vidal: \u201cTowards a Sound View Integration Methodology.\u201d In: ACM PODS 1983, pp. 39\u201348.","DOI":"10.1145\/588058.588065"},{"issue":"6","key":"13_CR6","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/5948.5952","volume":"29","author":"S. Ceri","year":"1986","unstructured":"Ceri, S., G. Gottlob: \u201cNormalization of Relations and Prolog.\u201d Comm. ACM 29,6 (June 1986), pp.524\u2013544.","journal-title":"Comm. ACM"},{"key":"13_CR7","unstructured":"Ceri, S., G. Gottlob, L. Lavazza: \u201cTranslation and Optimization of Logic Queries: The Algebraic Approach.\u201d Proc. of the 12th Int. Conf. on Very Large Data Bases, Kyoto, 1986, pp.395\u2013402."},{"key":"13_CR8","unstructured":"Ceri, S., G. Gottlob, A. Tanca: \u201cLogic Programming and Databases.\u201d Springer, 1988 (to appear)."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Chandra, A., M.Y. Vardi: \u201cThe implication problem for functional and inclusion dependencies is undecidable.\u201d In: SIAM J. on Computing, 1985, pp. 671\u2013677.","DOI":"10.1137\/0214049"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Chandra, A., H. R. Lewis, J. A. Makowsky: \u201cEmbedded Implicational Dependencies and their Inference Problem.\u201d Proc. of the ACM Symp. on Theory of Computing 1981, pp. 342\u2013254.","DOI":"10.1145\/800076.802488"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fagin, R.: \u201cHorn Clauses and Database Dependencies.\u201d ACM Symp. on Theory of Computing 1980, pp.123\u2013134.","DOI":"10.1145\/800141.804660"},{"key":"13_CR12","unstructured":"Ioannidis, Y.E.: \u201cOn the computation of the transitive closure of relational operators.\u201d Proc. of the 12th Int. Conf. on Very Large Data Bases, Kyoto, 1986."},{"key":"13_CR13","unstructured":"Lu, H.: \u201cNew Strategies for Computing the Transitive Closure of a Database Relation.\u201d Proc. of the 13th Int. Conf. on Very Large Data Bases, Brighton, 1987."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Lu, H., K. Mikkilieni, J. P. Richardson: \u201cDesign and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation.\u201d Proc. IEEE 3rd Int. Conf. on Data Engineering, Los Angeles 1987, pp. 112\u2013119.","DOI":"10.1109\/ICDE.1987.7272364"},{"key":"13_CR15","unstructured":"Maier, D.: \u201cThe Theory of Relational Databases,\u201d Computer Science Press, 1983."},{"issue":"4","key":"13_CR16","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/320107.320115","volume":"4","author":"D. Maier","year":"1979","unstructured":"Maier D., A.O. Mendelzon, J. Sagiv: \u201cTesting Implications of Data Dependencies.\u201d ACM TODS, 4,4 (December 1979), pp.455\u2013469.","journal-title":"ACM TODS"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Mitchell J.C.: \u201cInference Rules for Functional and Inclusion Dependencies.\u201d Proc. ACM PODS 1983, pp.58\u201369.","DOI":"10.1145\/588058.588067"},{"key":"13_CR18","volume-title":"Data Dependencies in the Relational Model of Data: A Generalization","author":"F. Sadri","year":"1980","unstructured":"Sadri F.: \u201cData Dependencies in the Relational Model of Data: A Generalization.\u201d Doctoral diss., Princeton Univ., Princeton, NJ, October 1980."},{"issue":"2","key":"13_CR19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/322307.322312","volume":"29","author":"F. Sadri","year":"1982","unstructured":"Sadri F., J.D. Ullman: \u201cA Complete Axiomatization for a Large Class of Dependencies in Relational Databases.\u201d Journal ACM 29,2 (February 1982), pp.363\u2013372.","journal-title":"Journal ACM"},{"issue":"1","key":"13_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/322290.322297","volume":"29","author":"Y. Sagiv","year":"1981","unstructured":"Sagiv Y., S. Walecka: \u2018Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies.\u201d Journal ACM 29,1 (January 1981), pp.103\u2013117.","journal-title":"Journal ACM"},{"issue":"1","key":"13_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: \u201cA Theorem on Boolean Matrices.\u201d Journal ACM 9,1 (January 1962), pp. 11\u201312.","journal-title":"Journal ACM"},{"issue":"4","key":"13_CR22","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"H.S. Warren","year":"1975","unstructured":"Warren, H.S.: \u201cA Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations.\u201d Comm. ACM 18,4 (April 1975), pp.218\u2013220.","journal-title":"Comm. ACM"},{"key":"13_CR23","unstructured":"Zloof, M.M.: \u201cQuery-By-Example: Operations on the Transitive Closure.\u201d RC 5526, IBM Yorktown Heights, 1975."}],"container-title":["Lecture Notes in Computer Science","MFDBS 89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51251-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:23Z","timestamp":1605648023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51251-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512516","9783540461821"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-51251-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}