{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:35:10Z","timestamp":1648665310654},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,11,11]],"date-time":"2012-11-11T00:00:00Z","timestamp":1352592000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10115-012-0582-x","type":"journal-article","created":{"date-parts":[[2012,11,10]],"date-time":"2012-11-10T08:05:25Z","timestamp":1352534725000},"page":"639-663","source":"Crossref","is-referenced-by-count":1,"title":["The address connector: noninvasive synchronization of hierarchical data sources"],"prefix":"10.1007","volume":"37","author":[{"given":"Nikolaus","family":"Augsten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"B\u00f6hlen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Gamper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,11]]},"reference":[{"key":"582_CR1","unstructured":"Arasu A, Ganti V, Kaushik R (2006) Efficient exact set-similarity joins. In: Proceedings of the international conference on very large databases (VLDB), VLDB Endowment, pp 918\u2013929"},{"issue":"4","key":"582_CR2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s00778-011-0254-6","volume":"21","author":"N Augsten","year":"2012","unstructured":"Augsten N, B\u00f6hlen M, Dyreson C, Gamper J (2012) Windowed $$pq$$ -grams for approximate joins of data-centric XML. VLDB J 21(4):463\u2013488","journal-title":"VLDB J"},{"key":"582_CR3","doi-asserted-by":"crossref","unstructured":"Augsten N, B\u00f6hlen M, Gamper J (2004) Reducing the integration of public administration databases to approximate tree matching. In: Electronic government\u2014third international conference, LNCS 3183. Springer, Zaragoza, pp 102\u2013107","DOI":"10.1007\/978-3-540-30078-6_17"},{"key":"582_CR4","unstructured":"Augsten N, B\u00f6hlen M, Gamper J (2005) Approximate matching of hierarchical data using $$pq$$ -grams. In: Proceedings of the international conference on very large databases (VLDB). ACM Press, Trondheim, pp 301\u2013312"},{"key":"582_CR5","unstructured":"Augsten N, B\u00f6hlen M, Gamper J (2006) An incrementally maintainable index for approximate lookups in hierarchical data. In: Proceedings of the international conference on very large databases (VLDB). ACM Press, Seoul, pp 247\u2013258"},{"issue":"1","key":"582_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1670243.1670247","volume":"35","author":"N Augsten","year":"2010","unstructured":"Augsten N, B\u00f6hlen M, Gamper J (2010) The $$pq$$ -gram distance between ordered labeled trees. ACM Trans Database Syst 35(1):1\u201336","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"582_CR7","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis D (1983) A survey of heuristics for the weighted matching problem. Networks 13(4):475\u2013493","journal-title":"Networks"},{"issue":"11","key":"582_CR8","doi-asserted-by":"crossref","first-page":"695","DOI":"10.14778\/3402707.3402710","volume":"4","author":"PA Bernstein","year":"2011","unstructured":"Bernstein PA, Madhavan J, Rahm E (2011) Generic schema matching, ten years later. Proc VLDB Endow 4(11):695\u2013701","journal-title":"Proc VLDB Endow"},{"key":"582_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Ganti V, Motwani R (2005) Robust identification of fuzzy duplicates. In: Proceedings of the international conference on data engineering (ICDE). IEEE Computer Science Press, Tokyo, pp 865\u2013876","DOI":"10.1109\/ICDE.2005.125"},{"key":"582_CR10","doi-asserted-by":"crossref","unstructured":"Cob\u00e9na G, Abiteboul S, Marian A (2002) Detecting changes in XML documents. In: Proceedings of the international conference on data engineering (ICDE). IEEE Computer Science Press, San Jose, California, pp 41\u201352","DOI":"10.1109\/ICDE.2002.994696"},{"key":"582_CR11","doi-asserted-by":"crossref","unstructured":"Demaine ED, Mozes S, Rossman B, Weimann O (2007) An optimal decomposition algorithm for tree edit distance. In: Proceedings of the 34th international colloquium on automata, languages and programming (ICALP 2007), vol 4596 of Lecture Notes in Computer Science. Springer, Wroclaw, pp 146\u2013157","DOI":"10.1007\/978-3-540-73420-8_15"},{"key":"582_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"issue":"1","key":"582_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-010-0285-0","volume":"27","author":"CF Dorneles","year":"2011","unstructured":"Dorneles CF, Gon\u00e7alves R (2011) Approximate data instance matching: a survey. Knowl Inf Syst 27(1):1\u201321","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"582_CR14","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248\u2013264","journal-title":"J ACM"},{"issue":"2","key":"582_CR15","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T Feder","year":"1992","unstructured":"Feder T (1992) A new fixed point approach for stable networks and stable marriages. J Comput Syst Sci 45(2):233\u2013284","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"582_CR16","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596\u2013615","journal-title":"J ACM"},{"issue":"1","key":"582_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9\u201315","journal-title":"Am Math Mon"},{"key":"582_CR18","doi-asserted-by":"crossref","unstructured":"Garofalakis M, Kumar A (2003) Correlating XML data streams using tree-edit distance embeddings. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS). ACM Press, San Diego, California, pp 143\u2013154","DOI":"10.1145\/773153.773168"},{"issue":"2","key":"582_CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10115-009-0277-0","volume":"26","author":"JM Gil","year":"2011","unstructured":"Gil JM, Montes JFA (2011) Evaluation of two heuristic approaches to solve the ontology meta-matching problem. Knowl Inf Syst 26(2):225\u2013247","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"582_CR20","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg AV, Tarjan RE (1988) A new approach to the maximum-flow problem. J ACM 35(4):921\u2013940","journal-title":"J ACM"},{"key":"582_CR21","unstructured":"Gravano L, Ipeirotis PG, Jagadish HV, Koudas N, Muthukrishnan S, Srivastava D (2001) Approximate string joins in a database (almost) for free. In: Proceedings of the international conference on very large databases (VLDB). Morgan Kaufmann, Roma, pp 491\u2013500"},{"key":"582_CR22","doi-asserted-by":"crossref","unstructured":"Guha S, Jagadish HV, Koudas N, Srivastava D, Yu T (2002) Approximate XML joins. In: Proceedings of the ACM SIGMOD international conference on management of data. ACM Press, Madison, pp 287\u2013298","DOI":"10.1145\/564691.564725"},{"key":"582_CR23","volume-title":"The stable marriage problem: structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. The MIT Press, Cambridge"},{"issue":"3","key":"582_CR24","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving RW, Leather P, Gusfield D (1987) An efficient algorithm for the \u201coptimal\u201d stable marriage. J ACM 34(3):532\u2013543","journal-title":"J ACM"},{"issue":"1","key":"582_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0269888903000651","volume":"18","author":"Y Kalfoglou","year":"2003","unstructured":"Kalfoglou Y, Schorlemmer M (2003) Ontology mapping: the state of the art. Knowl Eng Rev 18(1):1\u201331","journal-title":"Knowl Eng Rev"},{"key":"582_CR26","doi-asserted-by":"crossref","unstructured":"Klein PN (1998) Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th European symposium on algorithms, vol 1461 of Lecture Notes in Computer Science. Springer, Venice, pp 91\u2013102","DOI":"10.1007\/3-540-68530-8_8"},{"key":"582_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2:83\u201397","journal-title":"Naval Res Logist Q"},{"issue":"4","key":"582_CR28","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/321138.321140","volume":"9","author":"JM Kurtzberg","year":"1962","unstructured":"Kurtzberg JM (1962) On approximation methods for the assignment problem. J ACM 9(4):419\u2013439","journal-title":"J ACM"},{"key":"582_CR29","first-page":"8","volume":"1","author":"VI Levenshtein","year":"1965","unstructured":"Levenshtein VI (1965) Binary codes capable of correcting spurious insertions and deletions of ones. Probl Inf Transm 1:8\u201317","journal-title":"Probl Inf Transm"},{"issue":"1","key":"582_CR30","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31\u201388","journal-title":"ACM Comput Surv"},{"issue":"4","key":"582_CR31","doi-asserted-by":"crossref","first-page":"334","DOI":"10.14778\/2095686.2095692","volume":"5","author":"M Pawlik","year":"2011","unstructured":"Pawlik M, Augsten N (2011) RTED: a robust algorithm for the tree edit distance. Proc VLDB Endow (PVLDB) 5(4):334\u2013345","journal-title":"Proc VLDB Endow (PVLDB)"},{"issue":"4","key":"582_CR32","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s007780100057","volume":"10","author":"E Rahm","year":"2001","unstructured":"Rahm E, Bernstein PA (2001) A survey of approaches to automatic schema matching. VLDB J 10(4):334\u2013350","journal-title":"VLDB J"},{"key":"582_CR33","doi-asserted-by":"crossref","unstructured":"Sarawagi S, Kirpal A (2004) Efficient set joins on similarity predicates. In: Proceedings of the ACM SIGMOD international conference on management of data. ACM, New York, pp 743\u2013754","DOI":"10.1145\/1007568.1007652"},{"key":"582_CR34","doi-asserted-by":"crossref","unstructured":"Shvaiko P, Euzenat J (2005) A survey of schema-based matching approaches. J Data Semantics IV:146\u2013171","DOI":"10.1007\/11603412_5"},{"key":"582_CR35","unstructured":"Shvaiko P, Euzenat J (2011) Ontology matching: state of the art and future challenges. IEEE Trans Knowl Data Eng (99):1"},{"issue":"3","key":"582_CR36","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"KC Tai","year":"1979","unstructured":"Tai KC (1979) The tree-to-tree correction problem. J ACM 26(3):422\u2013433","journal-title":"J ACM"},{"issue":"1","key":"582_CR37","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen E (1992) Approximate string-matching with $$q$$ -grams and maximal matches. Theor Comput Sci 92(1):191\u2013211","journal-title":"Theor Comput Sci"},{"key":"582_CR38","volume-title":"Information retrieval","author":"CJ Rijsbergen van","year":"1979","unstructured":"van Rijsbergen CJ (1979) Information retrieval, 2nd edn. Butterworth-Heinemann, London","edition":"2"},{"issue":"1","key":"582_CR39","doi-asserted-by":"crossref","first-page":"933","DOI":"10.14778\/1453856.1453957","volume":"1","author":"C Xiao","year":"2008","unstructured":"Xiao C, Wang W, Lin X (2008) Ed-join: an efficient algorithm for similarity joins with edit distance constraints. Proc VLDB Endow 1(1):933\u2013944","journal-title":"Proc VLDB Endow"},{"key":"582_CR40","doi-asserted-by":"crossref","unstructured":"Yang R, Kalnis P, Tung AKH (2005) Similarity evaluation on tree-structured data. In: Proceedings of the ACM SIGMOD international conference on management of data. ACM Press, Baltimore, pp 754\u2013765","DOI":"10.1145\/1066157.1066243"},{"issue":"6","key":"582_CR41","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245\u20131262","journal-title":"SIAM J Comput"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0582-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0582-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0582-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T23:01:13Z","timestamp":1594854073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0582-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,11]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["582"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0582-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,11]]}}}