{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:44:37Z","timestamp":1746283477304,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327407"},{"type":"electronic","value":"9783642327414"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-32741-4_26","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T13:02:04Z","timestamp":1345554124000},"page":"285-296","source":"Crossref","is-referenced-by-count":1,"title":["Inference of XML Integrity Constraints"],"prefix":"10.1007","author":[{"given":"Matej","family":"Vit\u00e1sek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Ml\u00fdnkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Ahonen, H.: Generating Grammars for Structured Documents Using Grammatical Inference Methods. Ph.D. thesis, Department of Computer Science, University of Helsinki. Series of Publications A, Report A-1996-4 (1996)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-39429-7_12","volume-title":"Database and XML Technologies","author":"D. Barbosa","year":"2003","unstructured":"Barbosa, D., Mendelzon, A.: Finding ID Attributes in XML Documents. In: Bellahs\u00e8ne, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds.) XSym 2003. LNCS, vol.\u00a02824, pp. 180\u2013194. Springer, Heidelberg (2003)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1145\/1376616.1376750","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008","author":"G.J. Bex","year":"2008","unstructured":"Bex, G.J., Neven, F., Vansummeren, S.: SchemaScope: a System for Inferring and Cleaning XML Schemas. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, pp. 1259\u20131262. ACM, New York (2008)"},{"key":"26_CR4","unstructured":"Bray, T., Paoli, J., Maler, E., Yergeau, F., Sperberg-McQueen, C.M.: Extensible Markup Language (XML) 1.0, 5th edn. W3C recommendation, W3C (2008)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/371920.371984","volume-title":"Proceedings of the 10th International Conference on World Wide Web, WWW 2001","author":"P. Buneman","year":"2001","unstructured":"Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.C.: Keys for XML. In: Proceedings of the 10th International Conference on World Wide Web, WWW 2001, pp. 201\u2013210. ACM, New York (2001)"},{"key":"26_CR6","unstructured":"Dantzig, G.: Linear Programming and Extensions. Landmarks in Physics and Mathematics. Princeton University Press (1998)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Books. MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Fajt, S.: Mining XML Integrity Constraints. Master\u2019s thesis, Charles University in Prague (2010), http:\/\/www.ksi.mff.cuni.cz\/projects\/infer\/keyminer\/Fajt.pdf","DOI":"10.1109\/ICDIM.2011.6093314"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1552285.1552286","volume":"56","author":"F.V. Fomin","year":"2009","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A Measure & Conquer Approach for the Analysis of Exact Algorithms. J. ACM\u00a056, 25:1\u201325:32 (2009)","journal-title":"J. ACM"},{"key":"26_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"key":"26_CR11","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. In: Artificial Intelligence. Addison-Wesley Pub. Co. (1989)"},{"key":"26_CR12","unstructured":"Klempa, M., Mikula, M., Smetana, R., \u0160virec, M., Vit\u00e1sek, M.: jInfer Architecture (2011), http:\/\/jinfer.sourceforge.net\/modules\/architecture.pdf"},{"key":"26_CR13","unstructured":"Klempa, M., Mikula, M., Smetana, R., \u0160virec, M., Vit\u00e1sek, M.: jInfer: Java Framework for XML Schema Inference (2011), http:\/\/jinfer.sourceforge.net"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"V.T. Paschos","year":"1997","unstructured":"Paschos, V.T.: A survey of Approximately Optimal Solutions to Some Covering and Packing Problems. ACM Comput. Surv.\u00a029, 171\u2013209 (1997)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J. Robson","year":"1986","unstructured":"Robson, J.: Algorithms for Maximum Independent Sets. Journal of Algorithms\u00a07(3), 425\u2013440 (1986)","journal-title":"Journal of Algorithms"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Vit\u00e1sek, M.: Inference of XML Integrity Constraints. Master\u2019s thesis, Charles University in Prague (2012), http:\/\/www.ksi.mff.cuni.cz\/~mlynkova\/dp\/Vitasek.pdf","DOI":"10.1007\/978-3-642-32741-4_26"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-78568-2_6","volume-title":"Database Systems for Advanced Applications","author":"O. Vo\u0161ta","year":"2008","unstructured":"Vo\u0161ta, O., Ml\u00fdnkov\u00e1, I., Pokorn\u00fd, J.: Even an Ant Can Create an XSD. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol.\u00a04947, pp. 35\u201350. Springer, Heidelberg (2008)"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32741-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T01:06:58Z","timestamp":1743988018000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-32741-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642327407","9783642327414"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32741-4_26","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}