{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:56:03Z","timestamp":1725501363705},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540776833"},{"type":"electronic","value":"9783540776840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77684-0_8","type":"book-chapter","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T07:33:44Z","timestamp":1201592024000},"page":"78-95","source":"Crossref","is-referenced-by-count":2,"title":["Autonomous Sets \u2013 A Method for Hypergraph Decomposition with Applications in Database Theory"],"prefix":"10.1007","author":[{"given":"Henning","family":"Koehler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Armstrong, W.W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580\u2013583 (1974)","DOI":"10.1515\/9783110840308-026"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Sacc\u00e0, D.: Minimal representation of directed hypergraphs. SIAM J. Comput.\u00a015(2), 418\u2013431 (1986)","journal-title":"SIAM J. Comput."},{"key":"8_CR3","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C. Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets. Elsevier Science Pub. Co., Amsterdam (1989)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Biskup, J., Dayal, U., Bernstein, P.A.: Synthesizing independent database schemas. In: SIGMOD Conference, pp. 143\u2013151 (1979)","DOI":"10.1145\/582095.582118"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0020-0190(87)90110-4","volume":"24","author":"G. Gottlob","year":"1987","unstructured":"Gottlob, G.: On the size of nonredundant FD-covers. Inf. Process. Lett.\u00a024(6), 355\u2013360 (1987)","journal-title":"Inf. Process. Lett."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Tractable database design through bounded treewidth. In: PODS, pp. 124\u2013133 (2006)","DOI":"10.1145\/1142351.1142370"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11775096_11","volume-title":"Algorithmic Aspects in Information and Management","author":"H. Koehler","year":"2006","unstructured":"Koehler, H.: Finding faithful Boyce-Codd normal form decompositions. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 102\u2013113. Springer, Heidelberg (2006)"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2004.07.005","volume":"92","author":"J. Lechtenb\u00f6rger","year":"2004","unstructured":"Lechtenb\u00f6rger, J.: Computing unique canonical covers for simple FDs via transitive reduction. Inf. Process. Lett.\u00a092(4), 169\u2013174 (2004)","journal-title":"Inf. Process. Lett."},{"key":"8_CR10","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)"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(78)90009-0","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Osborn, S.L.: Candidate keys for relations. Journal of Computer and System Sciences\u00a017(2), 270\u2013279 (1978)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D. Maier","year":"1980","unstructured":"Maier, D.: Minimum covers in the relational database model. Journal of the ACM\u00a027(4), 664\u2013674 (1980)","journal-title":"Journal of the ACM"},{"key":"8_CR13","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)"},{"key":"8_CR14","volume-title":"The Design of Relational Databases","author":"H. Mannila","year":"1987","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.-J.: The Design of Relational Databases. Addison-Wesley, Reading (1987)"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(79)90082-6","volume":"8","author":"S.L. Osborn","year":"1979","unstructured":"Osborn, S.L.: Testing for existence of a covering Boyce-Codd normal form. Information Processing Letters\u00a08(1), 11\u201314 (1979)","journal-title":"Information Processing Letters"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/comjnl\/39.2.124","volume":"39","author":"H. Saiedian","year":"1996","unstructured":"Saiedian, H., Spencer, T.: An efficient algorithm to compute the candidate keys of a relational database schema. Comput. J.\u00a039(2), 124\u2013132 (1996)","journal-title":"Comput. J."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/319732.319749","volume":"7","author":"C. Zaniolo","year":"1982","unstructured":"Zaniolo, C.: A new normal form for the design of relational database schemata. ACM Trans. Database Syst.\u00a07(3), 489\u2013499 (1982)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77684-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:37Z","timestamp":1619520517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77684-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540776833","9783540776840"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77684-0_8","relation":{},"subject":[]}}