{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:52:06Z","timestamp":1725540726785},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049460"},{"type":"electronic","value":"9783642049477"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04947-7_10","type":"book-chapter","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T09:29:52Z","timestamp":1257845392000},"page":"75-84","source":"Crossref","is-referenced-by-count":2,"title":["On Matrix Representations of Participation Constraints"],"prefix":"10.1007","author":[{"given":"Sven","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Leck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Link","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"580","volume":"74","author":"W.W. Armstrong","year":"1974","unstructured":"Armstrong, W.W.: Dependency structures of database relationship. Inform. Process.\u00a074, 580\u2013583 (1974)","journal-title":"Inform. Process."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/2422.322414","volume":"31","author":"C. Beeri","year":"1984","unstructured":"Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of Armstrong relations for functional dependencies. J. ACM\u00a031, 30\u201346 (1984)","journal-title":"J. ACM"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0166-218X(96)00051-0","volume":"81","author":"F.E. Bennett","year":"1998","unstructured":"Bennett, F.E., Wu, L.: On minimum matrix representation of Sperner systems. Discrete Appl. Math.\u00a081, 9\u201317 (1998)","journal-title":"Discrete Appl. Math."},{"key":"10_CR4","volume-title":"Extremal graph theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal graph theory. Academic Press, London (1978)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/320434.320440","volume":"1","author":"P.P. Chen","year":"1976","unstructured":"Chen, P.P.: The entity-relationship model: towards a unified view of data. ACM Trans. Database Systems\u00a01, 9\u201336 (1976)","journal-title":"ACM Trans. Database Systems"},{"volume-title":"The CRC handbook of combinatorial designs","year":"1996","key":"10_CR6","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): The CRC handbook of combinatorial designs. CRC Press, Boca Raton (1996)"},{"key":"10_CR7","first-page":"247","volume":"4","author":"J. Demetrovics","year":"1979","unstructured":"Demetrovics, J.: On the equivalence of candidate keys and Sperner systems. Acta. Cybernet.\u00a04, 247\u2013252 (1979)","journal-title":"Acta. Cybernet."},{"key":"10_CR8","first-page":"295","volume":"5","author":"J. Demetrovics","year":"1981","unstructured":"Demetrovics, J., Gyepesi, G.: On the functional dependency and some generalizations of it. Acta. Cybernet.\u00a05, 295\u2013305 (1981)","journal-title":"Acta. Cybernet."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0378-3758(98)00029-9","volume":"72","author":"J. Demetrovics","year":"1998","unstructured":"Demetrovics, J., Katona, G.O.H., Sali, A.: Design type problems motivated by database theory. J. Statist. Plann. Inference\u00a072, 149\u2013164 (1998)","journal-title":"J. Statist. Plann. Inference"},{"key":"10_CR10","volume-title":"A seminar in graph theory","author":"P. Erd\u0151s","year":"1967","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: A seminar in graph theory, Holt, Rinehart and Winston (1967)"},{"key":"10_CR11","volume-title":"Combinatorial theory and its applications","author":"A. Hajnal","year":"1970","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of Erd\u0151s. In: Combinatorial theory and its applications. North-Holland, Amsterdam (1970)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1013133428451","volume":"33","author":"S. Hartmann","year":"2001","unstructured":"Hartmann, S.: On the implication problem for cardinality constraints and functional dependencies. Ann. Math. Art. Intell.\u00a033, 253\u2013307 (2001)","journal-title":"Ann. Math. Art. Intell."},{"key":"10_CR13","unstructured":"Hartmann, S.: Reasoning about participation constraints and Chen\u2019s constraints. In: ADC. CRPIT, vol.\u00a017, pp. 105\u2013113. ACS (2003)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-73445-1_15","volume-title":"Logic, Language, Information and Computation","author":"S. Hartmann","year":"2007","unstructured":"Hartmann, S., Link, S.: Numerical keys for XML. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 203\u2013217. Springer, Heidelberg (2007)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11663881_14","volume-title":"Foundations of Information and Knowledge Systems","author":"G.O.H. Katona","year":"2006","unstructured":"Katona, G.O.H., Tichler, K.: Some contributions to the minimum representation problem of key systems. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol.\u00a03861, pp. 240\u2013257. Springer, Heidelberg (2006)"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/0306-4379(90)90048-T","volume":"15","author":"M. Lenzerini","year":"1990","unstructured":"Lenzerini, M., Nobili, P.: On the satisfiability of dependency constraints in entity-relationship schemata. Inform. Systems\u00a015, 453\u2013461 (1990)","journal-title":"Inform. Systems"},{"key":"10_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-85729-349-7","volume-title":"A guided tour of relational databases and beyond","author":"M. Levene","year":"1999","unstructured":"Levene, M., Loizou, G.: A guided tour of relational databases and beyond. Springer, Heidelberg (1999)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0169-023X(93)90024-J","volume":"11","author":"S.W. Liddle","year":"1993","unstructured":"Liddle, S.W., Embley, D.W., Woodfield, S.N.: Cardinality constraints in semantic data models. Data Knowledge Eng.\u00a011, 235\u2013270 (1993)","journal-title":"Data Knowledge Eng."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-46439-5_24","volume-title":"Advances in Database Technology - EDBT 2000","author":"S. Lopes","year":"2000","unstructured":"Lopes, S., Petit, J.-M., Lakhal, L.: Efficient discovery of functional dependencies and Armstrong relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 350\u2013364. Springer, Heidelberg (2000)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.: Design by Example: An application of Armstrong relations. J. Comput. Syst. Sci., 126\u2013141 (1986)","DOI":"10.1016\/0022-0000(86)90015-2"},{"key":"10_CR21","volume-title":"The design of relational databases","author":"H. Mannila","year":"1992","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.: The design of relational databases. Addison-Wesley, Reading (1992)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0169-023X(98)00007-X","volume":"27","author":"A. McAllister","year":"1998","unstructured":"McAllister, A.: Complete rules for n-ary relationship cardinality constraints. Data Knowledge Eng.\u00a027, 255\u2013288 (1998)","journal-title":"Data Knowledge Eng."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Thalheim, B.: Dependencies in relational databases. Teubner (1991)","DOI":"10.1007\/978-3-663-12018-6"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/3-540-56023-8_3","volume-title":"Entity-Relationship Approach - ER \u201992","author":"B. Thalheim","year":"1992","unstructured":"Thalheim, B.: Fundamentals of cardinality constraints. In: Pernul, G., Tjoa, A.M. (eds.) ER 1992. LNCS, vol.\u00a0645, pp. 7\u201323. Springer, Heidelberg (1992)"},{"key":"10_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04058-4","volume-title":"Entity-relationship modeling","author":"B. Thalheim","year":"2000","unstructured":"Thalheim, B.: Entity-relationship modeling. Springer, Berlin (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Conceptual Modeling - Challenging Perspectives"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04947-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:14:14Z","timestamp":1619766854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04947-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049460","9783642049477"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04947-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}