{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:16:08Z","timestamp":1725804968494},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112176"},{"type":"electronic","value":"9783319112183"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-11218-3_40","type":"book-chapter","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T11:16:15Z","timestamp":1410174975000},"page":"445-456","source":"Crossref","is-referenced-by-count":0,"title":["A Method to Induce Indicative Functional Dependencies for Relational Data Model"],"prefix":"10.1007","author":[{"given":"Sandhya","family":"Harikumar","sequence":"first","affiliation":[]},{"given":"R.","family":"Reethima","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Synthesizing Third Normal Form Relations from Functional Dependencies philip a. bernstein, University of Toronto. ACM Transactions on Database Systems\u00a01(4) (December 1976)","DOI":"10.1145\/320493.320489"},{"key":"40_CR2","unstructured":"Yao, H., Hamilton, H.J., Butz, C.: FDMine Discovering Functional Dependencies in a Database Using Equivalences. In: International Conference on Data Mining 2002, pp. 729\u2013732 (2002)"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","volume":"40","author":"H. Mannila","year":"1992","unstructured":"Mannila, H., Raiha, K.-J.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics\u00a040, 237\u2013243 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR4","first-page":"123","volume-title":"Advances in Database Theory","author":"P.D. Bra","year":"1984","unstructured":"Bra, P.D., Paredaens, J.: Horizontal decompositions for handling exceptions to functional dependencies. In: Gallaire, H., Minker, J., Nicolas, J.M. (eds.) Advances in Database Theory, vol.\u00a02, pp. 123\u2013141. Plenum Publishing Company, New York (1984)"},{"issue":"2","key":"40_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y. Huhtala","year":"1999","unstructured":"Huhtala, Y., Krkkinen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computing Journal\u00a042(2), 100\u2013111 (1999)","journal-title":"The Computing Journal"},{"issue":"3","key":"40_CR6","first-page":"139","volume":"12","author":"P.A. Flach","year":"1999","unstructured":"Flach, P.A., Savnik, I.: Database Dependency Discovery: A Machine Learning Approach. AI Communications\u00a012(3), 139\u2013160 (1999)","journal-title":"AI Communications"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-44801-2_11","volume-title":"Data Warehousing and Knowledge Discovery","author":"C.M. Wyss","year":"2001","unstructured":"Wyss, C.M., Giannella, C.M., Robertson, E.L.: FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol.\u00a02114, pp. 101\u2013110. Springer, Heidelberg (2001)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"He, Q., Link, T.W.: Extending Inferring Functional Dependencies in Schema Transformation. In: ACM 2004 (2004)","DOI":"10.1145\/1031171.1031177"},{"key":"40_CR9","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments, 5th edn. Wiley (2001)"},{"key":"40_CR10","unstructured":"Savnik, I., Flach, P.: Bottom-up induction of functional dependencies from relations. In: Piatetsky-Shapiro, G. (ed.) Knowledge Discovery in Databases, Papers from the 1993 AAAI Workshop (KDD 1993), Washington, DC, pp. 174\u2013185. AAAI Press (1993)"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0169-023X(94)90023-X","volume":"12","author":"H. Mannila","year":"1994","unstructured":"Mannila, H., Raiha, K.-J.: Algorithms for inferring functional dependencies. Data & Knowledge Engineering\u00a012, 83\u201399 (1994)","journal-title":"Data & Knowledge Engineering"},{"key":"40_CR12","unstructured":"Bell, S., Brockhausen, P.: Discovery of Data Dependencies in Relational Databases. Technical Report LS-8 Report-14, University of Dortmund (1995)"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J. Kivinen","year":"1995","unstructured":"Kivinen, J., Mannila, H.: Approximate dependency inference from relations. Theor. Comp. Sci.\u00a0149, 129\u2013149 (1995)","journal-title":"Theor. Comp. Sci."}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Intelligent Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11218-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:48:46Z","timestamp":1558990126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11218-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319112176","9783319112183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11218-3_40","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}