{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:26Z","timestamp":1740123506325,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T00:00:00Z","timestamp":1452729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Science and Innovation Ministry of Spain"},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11227-016-1622-1","type":"journal-article","created":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T14:48:05Z","timestamp":1452782885000},"page":"75-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reducing the search space by closure and simplification paradigms"],"prefix":"10.1007","volume":"73","author":[{"given":"F.","family":"Benito-Picazo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Cordero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Enciso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Mora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,14]]},"reference":[{"key":"1622_CR1","doi-asserted-by":"crossref","unstructured":"Benito-Picazo F, Cordero P, Enciso M, Mora A (2014) Increasing the efficiency of minimal key enumeration methods by means of parallelism. In: ICSOFT-EA 2014\u2014proceedings of the 9th international conference on software engineering and applications, Vienna, Austria, 29\u201331 August 2014, pp 512\u2013517","DOI":"10.5220\/0005108205120517"},{"issue":"6","key":"1622_CR2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"EF Codd","year":"1970","unstructured":"Codd EF (1970) A relational model of data for large shared data banks. Commun ACM 13(6):377\u2013387","journal-title":"Commun ACM"},{"key":"1622_CR3","unstructured":"Cordero P, Enciso M, Mora A (2013) Automated reasoning to infer all minimal keys. In: Proceedings of the twenty-third international joint conference on artificial intelligence, IJCAI\u201913. AAAI Press, pp 817\u2013823"},{"key":"1622_CR4","unstructured":"Cordero P, Enciso M, Mora A, de Guzm\u00e1n IP (2002) $$\\text{ Sl }_{\\text{ fd }}$$ Sl fd logic: elimination of data redundancy in knowledge representation. In: Advances in artificial intelligence 8th Ibero-American conference on AI, Seville, Spain, November 12\u201315, pp 141\u2013150"},{"issue":"6","key":"1622_CR5","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1093\/jigpal\/jzu025","volume":"22","author":"P Cordero","year":"2014","unstructured":"Cordero P, Enciso M, Mora A, de Guzm\u00e1n IP (2014) A tableaux-like method to infer all minimal keys. Log J IGPL 22(6):1019\u20131044","journal-title":"Log J IGPL"},{"key":"1622_CR6","volume-title":"Formal concept analysis: mathematical foundations","author":"B Ganter","year":"1997","unstructured":"Ganter B, Wille R (1997) Formal concept analysis: mathematical foundations, 1st edn. Springer-Verlag New York Inc, Secaucus","edition":"1"},{"issue":"5","key":"1622_CR7","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/qre.1078","volume":"26","author":"TN Goh","year":"2010","unstructured":"Goh TN (2010) An information management paradigm for statistical experiments. Qual Reliab Eng Int 26(5):487\u2013494","journal-title":"Qual Reliab Eng Int"},{"key":"1622_CR8","unstructured":"Krajca P, Outrata J, Vychodil V (2008) Parallel recursive algorithm for FCA. In: 6th International conference on concept lattices and their applications (CLA), vol 433. CEUR WS, Olomouc, pp 71\u201382 (2008)"},{"key":"1622_CR9","unstructured":"L\u00e8vy G, Baklouti F (2005) A distributed version version of the ganter algorithm for general galois lattices. In: 3rd International conference on concept lattices and their applications (CLA), vol 162. CEUR WS, Olomouc, pp 207\u2013221"},{"issue":"2","key":"1622_CR10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(78)90009-0","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi CL, Osborn SL (1978) Candidate keys for relations. J Comput Syst Sci 17(2):270\u2013279","journal-title":"J Comput Syst Sci"},{"key":"1622_CR11","volume-title":"The theory of relational databases","author":"D Maier","year":"1983","unstructured":"Maier D (1983) The theory of relational databases. Computer Science Press, Rockville"},{"issue":"4","key":"1622_CR12","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1080\/00207160.2011.644275","volume":"89","author":"A Mora","year":"2012","unstructured":"Mora A, Cordero P, Enciso M, Fortes I, Aguilera G (2012) Closure via functional dependence simplification. Int J Comput Math 89(4):510\u2013526","journal-title":"Int J Comput Math"},{"issue":"9","key":"1622_CR13","doi-asserted-by":"crossref","first-page":"1860","DOI":"10.1080\/00207160.2010.484488","volume":"88","author":"A Mora","year":"2011","unstructured":"Mora A, de Guzm\u00e1n IP, Enciso M, Cordero P (2011) Ideal non-deterministic operators as a formal framework to reduce the key finding problem. Int J Comput Math 88(9):1860\u20131868","journal-title":"Int J Comput Math"},{"key":"1622_CR14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.websem.2013.07.001","volume":"23","author":"N Pernelle","year":"2013","unstructured":"Pernelle N, Sas F, Symeonidou D (2013) An automatic key discovery approach for data linking. Web Semant Sci Serv Agents WWW 23:16\u201330","journal-title":"Web Semant Sci Serv Agents WWW"},{"issue":"2","key":"1622_CR15","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1093\/comjnl\/39.2.124","volume":"39","author":"H Saiedian","year":"1996","unstructured":"Saiedian H, Spencer T (1996) An efficient algorithm to compute the candidate keys of a relational database schema. Comput J 39(2):124\u2013132","journal-title":"Comput J"},{"key":"1622_CR16","unstructured":"Sismanis Y, Brown P, Haas PJ, Reinwald B (2006) Gordian: efficient and scalable discovery of composite keys. In: Proceedings of the international conference on very large data bases, pp 691\u2013702"},{"key":"1622_CR17","doi-asserted-by":"crossref","unstructured":"Sridhar R, Iyengar SS (1990) Efficient parallel algorithms for functional dependency manipulations. In: Proceedings of the 2nd international symposium on databases in parallel and distributed systems, DPDS \u201990, pp 126\u2013137","DOI":"10.1109\/DPDS.1990.113704"},{"key":"1622_CR18","unstructured":"Valtchev P, Duquenne V (2003) Towards scalable divide-and-conquer methods for computing concepts and implications. In: 4th International conference Journ\u00e8es de l\u2019Informatique Messine (JIM03): knowledge discovery and discrete mathematics, Metz (FR), pp 3\u201314"},{"key":"1622_CR19","doi-asserted-by":"crossref","unstructured":"Valtchev P, Duquenne V (2008) On the merge of factor canonical bases. In: International conference on formal concept analysis (ICFCA). Lecture notes in computer science, vol 4933. Springer, Berlin, pp 182\u2013198","DOI":"10.1007\/978-3-540-78137-0_14"},{"key":"1622_CR20","first-page":"547","volume":"4","author":"R Wastl","year":"1998","unstructured":"Wastl R (1998) On the number of keys of a relational database schema. J Univers Comput Sci 4:547\u2013559","journal-title":"J Univers Comput Sci"},{"issue":"1\u20134","key":"1622_CR21","first-page":"177","volume":"167","author":"PB Worland","year":"2004","unstructured":"Worland PB (2004) An efficient algorithm for 3nf determination. Inf Sci Inf Comput Sci 167(1\u20134):177\u2013192","journal-title":"Inf Sci Inf Comput Sci"},{"issue":"4","key":"1622_CR22","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0020-0190(76)90003-X","volume":"5","author":"CT Yu","year":"1976","unstructured":"Yu CT, Johnson DT (1976) On the complexity of finding the set of candidate keys for a given set of functional dependencies. Inf Process Lett 5(4):100\u2013101","journal-title":"Inf Process Lett"},{"key":"1622_CR23","doi-asserted-by":"crossref","unstructured":"Zobel J (1998) How reliable are the results of large-scale information retrieval experiments? In: Proceedings of the 21st annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201998, pp 307\u2013314","DOI":"10.1145\/290941.291014"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1622-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1622-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1622-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1622-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T20:13:00Z","timestamp":1718309580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1622-1"}},"subtitle":["A parallel key finding method"],"short-title":[],"issued":{"date-parts":[[2016,1,14]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1622"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1622-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2016,1,14]]}}}