{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:56:42Z","timestamp":1648886202320},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,10]],"date-time":"2008-07-10T00:00:00Z","timestamp":1215648000000},"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":[[2008,10]]},"DOI":"10.1007\/s10844-008-0060-9","type":"journal-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T01:38:02Z","timestamp":1215567482000},"page":"127-146","source":"Crossref","is-referenced-by-count":1,"title":["Approximate schemas, source-consistency and query answering"],"prefix":"10.1007","volume":"31","author":[{"given":"Michel","family":"de Rougemont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Vieilleribi\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,10]]},"reference":[{"issue":"6","key":"60_CR1","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N. Alon","year":"2000","unstructured":"Alon, N., Krivelich, M., Newman, I., & Szegedy, M. (2000). Regular languages are testable with a constant number of queries. SIAM Journal on Computing, 30(6), 1842\u20131862.","journal-title":"SIAM Journal on Computing"},{"key":"60_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63220-4","volume-title":"Pattern matching algorithms","author":"A. Apostolico","year":"1997","unstructured":"Apostolico, A., & Galil, Z. (1997). Chapter 14: Approximate tree pattern matching. In Pattern matching algorithms. Oxford: Oxford University Press."},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Arenas, M., & Libkin, L. (2005). Xml data exchange: Consistency and query answering. In Proceedings of ACM symposium on principles of database systems (pp. 13\u201324).","DOI":"10.1145\/1065167.1065171"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Boobna, U., & de\u00a0Rougemont, M. (2004). Correctors for XML data. In International XML database symposium, XSym (pp. 97\u2013111).","DOI":"10.1007\/978-3-540-30081-6_8"},{"key":"60_CR5","unstructured":"Broder, A. (1997). On the resemblance and containment of documents. In Proceedings of compression and complexity of sequences (p.\u00a021)."},{"key":"60_CR6","unstructured":"Cormode, G., & Muthukrishnan, S. (2002). The string edit distance matching problem with moves. In Symposium on discrete algorithms (pp. 667\u2013676)."},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L. (2003). Data exchange: Semantics and query answering. In International conference on database theory (pp. 207\u2013224).","DOI":"10.1007\/3-540-36285-1_14"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Fischer, E., Magniez, F., & de\u00a0Rougemont, M. (2006). Approximate satisfiability and equivalence. In Proceedings of 21st IEEE symposium on logic in computer science (pp. 421\u2013430).","DOI":"10.1109\/LICS.2006.12"},{"issue":"4","key":"60_CR9","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., & Ron, D. (1998). Property testing and its connection to learning and approximation. Journal of the ACM, 45(4), 653\u2013750.","journal-title":"Journal of the ACM"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Magniez, F., & de\u00a0Rougemont, M. (2004). Property testing of regular tree languages. In International conference on automata languages and programming (ICALP) (pp. 932\u2013944).","DOI":"10.1007\/978-3-540-27836-8_78"},{"key":"60_CR11","doi-asserted-by":"crossref","unstructured":"Martens, W., & Neven, F. (2004). Frontiers of tractability for typechecking simple xml transformations. In Principles of database systems (pp. 23\u201334).","DOI":"10.1145\/1055558.1055563"},{"issue":"1","key":"60_CR12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"M. Masek","year":"1980","unstructured":"Masek, M., & Paterson, M. (1980). A faster algorithm for computing string edit distance. Journal of Computer and System Sciences, 20(1), 18\u201331.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"60_CR13","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. J. Parikh","year":"1966","unstructured":"Parikh, R. J. (1966). On context-free languages. Journal of the ACM (JACM), 13(4), 570\u2013581.","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"60_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., & Sudan, M. (1996). Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2), 23\u201332.","journal-title":"SIAM Journal on Computing"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Shapira, D., & Storer, J. (2002). Edit distance with move operations. In Proceedings of symposium on combinatorial pattern matching, Lecture Notes in Computer Science (Vol. 2373, pp. 85\u201398). Verlag.","DOI":"10.1007\/3-540-45452-7_9"},{"key":"60_CR16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. C. Tai","year":"1979","unstructured":"Tai, K. C. (1979). The tree-to-tree correction problem. Journal of the Association for Computing Machinery, 26, 422\u2013433.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"60_CR17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"Thatcher, J. W. (1967). Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 1, 317\u2013322.","journal-title":"Journal of Computer and System Sciences"},{"key":"60_CR18","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., & Fisher, M. (1974). The string-to-string correction problem. Journal of the Association for Computing Machinery, 21, 168\u2013173.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-008-0060-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-008-0060-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-008-0060-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:10:47Z","timestamp":1559254247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-008-0060-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s10844-008-0060-9","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,10]]}}}