{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:06:23Z","timestamp":1775012783745,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,26]],"date-time":"2008-01-26T00:00:00Z","timestamp":1201305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10844-007-0048-x","type":"journal-article","created":{"date-parts":[[2008,1,25]],"date-time":"2008-01-25T22:24:34Z","timestamp":1201299874000},"page":"53-73","source":"Crossref","is-referenced-by-count":49,"title":["Unary and n-ary inclusion dependency discovery in relational databases"],"prefix":"10.1007","volume":"32","author":[{"given":"Fabien De","family":"Marchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Lopes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,26]]},"reference":[{"key":"48_CR1","volume-title":"Foundations of databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., & Vianu, V. (1995). Foundations of databases. Reading, MA: Addison-Wesley."},{"key":"48_CR2","first-page":"2","volume-title":"International conference on knowledge discovery and data mining (KDD\u201904)","author":"F. N. Afrati","year":"2004","unstructured":"Afrati, F. N., Gionis, A., & Mannila H. (2004). Approximating a collection of frequent sets. In W. Kim, R. Kohavi, J. Gehrke, & W. DuMouchel (Eds.), International conference on knowledge discovery and data mining (KDD\u201904) (pp. 2\u201319). Washington, USA: ACM."},{"key":"48_CR3","first-page":"487","volume-title":"International conference on very large data bases (VLDB\u201994)","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In J. B. Bocca, M. Jarke, & C. Zaniolo (Eds.), International conference on very large data bases (VLDB\u201994) (pp. 487\u2013499). Santiago de Chile, Chile: Morgan Kaufmann."},{"key":"48_CR4","unstructured":"Albrecht, M., Buchholz, E., D\u00fcsterh\u00f6ft, A., & Thalheim, B. (1995). An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. In L. Libkin & B. Thalheim (Eds.), Semantics in databases (Vol. 1358, pp. 1\u201328). Lecture Notes in Computer Science, Springer."},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Bauckmann, J., Leser, U., Naumann, F., & Tietz, V. (2007). Efficiently detecting inclusion dependencies. In International conference on data engineering (ICDE\u201907) (pp. 1448\u20131450). IEEE Computer Society.","DOI":"10.1109\/ICDE.2007.369032"},{"key":"48_CR6","unstructured":"Bay, S. D. (1999). The UCI KDD archive [ http:\/\/kdd.ics.uci.edu ]. Technical report, Irvine, CA: University of California, Department of Information and Computer Science."},{"key":"48_CR7","unstructured":"Bell, S., & Brockhausen, P. (1995). Discovery of constraints and data dependencies in databases (extended abstract). In N. Lavrac & S. Wrobel (Eds.), European conference on machine learning (ECML\u201995) (Vol. 912, pp. 267\u2013270). Crete, Greece: Lecture Notes in Computer Science, Springer."},{"key":"48_CR8","volume-title":"International workshop on database programming languages (DBPL\u201901)","author":"T. Calders","year":"2001","unstructured":"Calders, T., & Wijsen, J. (2001). On monotone data mining languages. In G. Ghelli & G. Grahne (Eds.), International workshop on database programming languages (DBPL\u201901), Frascati, Italy: Springer."},{"issue":"1","key":"48_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0022-0000(84)90075-8","volume":"24","author":"M. Casanova","year":"1984","unstructured":"Casanova, M., Fagin, R., & Papadimitriou C. (1984). Inclusion dependencies and their interaction with functional dependencies. Journal of Computer and System Sciences, 24(1), 29\u201359.","journal-title":"Journal of Computer and System Sciences"},{"key":"48_CR10","first-page":"38","volume-title":"International conference on very large data bases (VLDB\u201988)","author":"M. A. Casanova","year":"1988","unstructured":"Casanova, M. A., Tucherman, L., & Furtado, A. L. (1988). Enforcing inclusion dependencies and referencial integrity. In F. Bancilhon & D. J. DeWitt (Eds.), International conference on very large data bases (VLDB\u201988) (pp. 38\u201349). Los Angeles, CA, USA: Morgan Kaufmann."},{"key":"48_CR11","first-page":"687","volume-title":"International conference on very large data bases (VLDB\u201999)","author":"Q. Cheng","year":"1999","unstructured":"Cheng, Q., Gryz, J., Koo, F., Leung, T. Y. C., Liu, L., Qian, X., et\u00a0al. (1999). Implementation of two semantic query optimization techniques in DB2 universal database. In M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, & M. L. Brodie (Eds.), International conference on very large data bases (VLDB\u201999) (pp. 687\u2013698). Edinburgh, Scotland, UK: Morgan Kaufmann."},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Dasu, T., Johnson, T., Muthukrishnan, S., & Shkapenyuk, V. (2002). Mining database structure; or, how to build a data quality browser. In ACM SIGMOD conference 2002 (pp. 240\u2013251). Madison, WI, USA.","DOI":"10.1145\/564691.564719"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"De Marchi, F., Lopes, S., & Petit, J.-M. (2002). Efficient algorithms for mining inclusion dependencies. In C. S. Jensen, K. G. Jeffery, J. Pokorn\u00fd, S. Saltenis, E. Bertino, K. B\u00f6hm, et\u00a0al. (Eds.), International conference on extending database technology (EDBT\u201902) (Vol. 2287, pp. 464\u2013476). Prague, Czech Republic: Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/3-540-45876-X_30"},{"issue":"1","key":"48_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/640990.640997","volume":"32","author":"F. Marchi De","year":"2003","unstructured":"De Marchi, F., Lopes, S., Petit, J.-M., & Toumani, F. (2003). Analysis of existing databases at the logical level: The DBA companion project. ACM Sigmod Record, 32(1), 47\u201352.","journal-title":"ACM Sigmod Record"},{"key":"48_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/ICDM.2003.1250899","volume-title":"International conference on data mining (ICDM\u201903)","author":"F. Marchi De","year":"2003","unstructured":"De Marchi, F., & Petit, J.-M. (2003). Zigzag: A new algorithm for discovering large inclusion dependencies in relational databases. In International conference on data mining (ICDM\u201903) (pp. 27\u201334). Melbourne, FL, USA: IEEE Computer Society."},{"key":"48_CR16","volume-title":"International conference on intelligent information system (IIS\u201905)","author":"F. Marchi De","year":"2005","unstructured":"De Marchi, F., & Petit, J.-M. (2005). Approximating a set of approximate inclusion dependencies. In International conference on intelligent information system (IIS\u201905) (pp.\u00a0633\u2013640). Gdansk, Poland: Springer-Verlag."},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Ganter, B., & Wille, R. (1999). Formal concept analysis. Springer-Verlag.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"48_CR18","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/ICDE.1998.655768","volume-title":"International conference on data engineering (ICDE\u201998)","author":"J. Gryz","year":"1998","unstructured":"Gryz, J. (1998). Query folding with inclusion dependencies. In International conference on data engineering (ICDE\u201998) (pp. 126\u2013133). Orlando, FL, USA: IEEE Computer Society."},{"key":"48_CR19","unstructured":"Han, J., & Kamber, M. (2000). Data mining: Concepts and techniques. Morgan Kaufmann."},{"issue":"2","key":"48_CR20","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y. Huhtala","year":"1999","unstructured":"Huhtala, Y., Karkkainen, J, Porkka, P., & Toivonen, H. (1999). TANE: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2), 100\u2013111.","journal-title":"The Computer Journal"},{"key":"48_CR21","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1002\/int.4550070703","volume":"7","author":"M. Kantola","year":"1992","unstructured":"Kantola, M., Mannila, H., Ra\u00efha K. J., & Siirtola, H. (1992). Discovering functional and inclusion dependencies in relational databases. International Journal of Intelligent Systems, 7, 591\u2013607.","journal-title":"International Journal of Intelligent Systems"},{"issue":"1","key":"48_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J. Kivinen","year":"1995","unstructured":"Kivinen, J., & Mannila, H. (1995). Approximate inference of functional dependencies from relations. Theoretical Computer Science, 149(1), 129\u2013149.","journal-title":"Theoretical Computer Science"},{"key":"48_CR23","unstructured":"Koeller, A., & Rundensteiner, E. A. (2003). Discovery of high-dimentional inclusion dependencies (Poster). In Poster session of international conference on data engineering (ICDE\u201903). IEEE Computer Society."},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"Levene, M., & Loizou, G. (1999). A guided tour of relational databases and beyond. Springer.","DOI":"10.1007\/978-0-85729-349-7"},{"issue":"2","key":"48_CR25","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/69.842267","volume":"12","author":"M. Levene","year":"2000","unstructured":"Levene, M., & Vincent, M. W. (2000). Justification for inclusion dependency normal form. IEEE Transactions on Knowledge and Data Engineering, 12(2), 281\u2013291.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"48_CR26","unstructured":"Lopes, S., De Marchi, F., & Petit, J.-M. (2004). DBA companion: A tool for logical database tuning. In Demo session of international conference on data engineering (ICDE\u201904). http:\/\/www.isima.fr\/~demarchi\/dbacomp\/ , IEEE Computer Society."},{"issue":"2\/3","key":"48_CR27","first-page":"93","volume":"14","author":"S. Lopes","year":"2002","unstructured":"Lopes, S., Petit, J.-M., & Lakhal, L. (2002a). Functional and approximate dependencies mining: Databases and FCA point of view. Special issue of JETAI, 14(2\/3), 93\u2013114.","journal-title":"Special issue of JETAI"},{"issue":"1","key":"48_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0306-4379(01)00027-8","volume":"17","author":"S. Lopes","year":"2002","unstructured":"Lopes, S., Petit, J.-M., & Toumani, F. (2002b). Discovering interesting inclusion dependencies: Application to logical database tuning. Information System, 17(1), 1\u201319.","journal-title":"Information System"},{"key":"48_CR29","unstructured":"Mannila, H., & R\u00e4ih\u00e4, K. J. (1994). The design of relational databases (2nd ed.). Addison-Wesley."},{"key":"48_CR30","volume-title":"International conference on data engineering (ICDE\u201986)","author":"H. Mannila","year":"1986","unstructured":"Mannila, H., & R\u00e4ih\u00e4, K.-J. (1986). Inclusion dependencies in database design. In International conference on data engineering (ICDE\u201986) (pp.\u00a0713\u2013718). Los Angeles, CA, USA: IEEE Computer Society."},{"issue":"1","key":"48_CR31","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., & Toivonen, H. (1997). Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(1), 241\u2013258.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"48_CR32","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/373626.373713","volume":"30","author":"R. J. Miller","year":"2001","unstructured":"Miller, R. J., Hernandez, M. A., Haas, L. M., Yan, L., Ho, C. T. H., Fagin, R. et\u00a0al. (2001). The clio project: Managing heterogeneity. ACM SIGMOD Record, 30(1), 78\u201383.","journal-title":"ACM SIGMOD Record"},{"issue":"3","key":"48_CR33","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/S0019-9958(83)80002-3","volume":"56","author":"J. C. Mitchell","year":"1983","unstructured":"Mitchell, J. C. (1983). The implication problem for functional and inclusion dependencies. Information and Control, 56(3), 154\u2013173.","journal-title":"Information and Control"},{"issue":"7","key":"48_CR34","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/S0306-4379(01)00032-1","volume":"26","author":"N. Novelli","year":"2001","unstructured":"Novelli, N., & Cicchetti, R. (2001). Functional and embedded dependency inference: A data mining point of view. Information System, 26(7), 477\u2013506.","journal-title":"Information System"},{"issue":"2\/3","key":"48_CR35","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009887712954","volume":"4","author":"S. Sarawagi","year":"2000","unstructured":"Sarawagi, S., Thomas, S., & Agrawal, R. (2000). Integrating association rule mining with relational database systems: Alternatives and implications. Data Mining and Knowledge Discovery, 4(2\/3), 89\u2013125.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"48_CR36","doi-asserted-by":"crossref","unstructured":"Wyss, C., Giannella, C., & Robertson, E. (2001). FastFDs: A heuristic-driven depth-first algorithm for mining functional dependencies from relation instances. In Y. Kambayashi, W. Winiwarter, & M. Arikawa (Eds.), Data warehousing and knowledge discovery (DaWaK\u201901) (Vol.\u00a02114, pp.\u00a0101\u2013110). Munich, Germany: Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-44801-2_11"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-007-0048-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-007-0048-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-007-0048-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:10:47Z","timestamp":1559268647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-007-0048-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,26]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s10844-007-0048-x","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,26]]}}}