{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:25:19Z","timestamp":1738387519544,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857129"},{"type":"electronic","value":"9783540857136"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85713-6_18","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:41:15Z","timestamp":1219074075000},"page":"246-261","source":"Crossref","is-referenced-by-count":6,"title":["Evaluating Performance and Quality of XML-Based Similarity Joins"],"prefix":"10.1007","author":[{"given":"Leonardo","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theo","family":"H\u00e4rder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Amit, C., Hassanzadeth, O., Koudas, N., Sadoghi, M.: Benchmarking Declarative Approximate Selection Predicates. In: Proc. SIGMOD Conf., pp. 353\u2013364 (2007)","DOI":"10.1145\/1247480.1247521"},{"key":"18_CR2","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient Set-Similarity Joins. In: Proc. VLDB Conf., pp. 918\u2013929 (2006)"},{"key":"18_CR3","unstructured":"Augsten, N., B\u00f6hlen, M., Gamper, J.: Approximate Matching of Hierarchical Data using pq-Grams. In: Proc. VLDB Conf., pp. 301\u2013312 (2005)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganjam, K., Kaushik, R.: A Primitive Operator for Similarity Joins in Data Cleaning. In Proc. ICDE Conf., p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Gravano, L., Ipeirotis, P., Jagadish, H., Koudas, N., Srivastava, D.: Text Joins in an RDBMS for Web Data Integration. In: Proc. WWW Conf., pp. 90\u2013101 (2003)","DOI":"10.1145\/775152.775166"},{"key":"18_CR6","unstructured":"Gravano, L., Ipeirotis, P., Jagadish, H., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate String Joins in a Database (Almost) for Free. In: Proc. VLDB Conf., pp. 491\u2013500 (2001)"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/1132863.1132868","volume":"31","author":"S. Guha","year":"2006","unstructured":"Guha, S., Jagadish, H., Koudas, N., Srivastava, D., Yu, T.: Integrating XML Data Sources using Approximate Joins. TODS\u00a031(1), 161\u2013207 (2006)","journal-title":"TODS"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.datak.2005.11.008","volume":"60","author":"T. H\u00e4rder","year":"2007","unstructured":"H\u00e4rder, T., Haustein, M., Mathis, C., Wagner, M.: Node labeling schemes for dynamic XML documents reconsidered. DKE\u00a060(1), 126\u2013149 (2007)","journal-title":"DKE"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"H\u00e4rder, T., Mathis, C., Schmidt, K.: Comparison of Complete and Elementless Native Storage of XML Documents. In: Proc. IDEAS 2007, pp. 102\u2013113 (2007)","DOI":"10.1109\/IDEAS.2007.4318094"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.datak.2006.06.015","volume":"61","author":"M.P. Haustein","year":"2007","unstructured":"Haustein, M.P., H\u00e4rder, T.: An Efficient Infrastructure for Native Transactional XML Processing. DKE\u00a061(3), 500\u2013523 (2007)","journal-title":"DKE"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv.\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"key":"18_CR12","unstructured":"Ribeiro, L., H\u00e4rder, T.: Embedding Similarity Joins into Native XML Databases. In: Proc. 22nd Brasilian Symposium on Databases, pp. 285\u2013299 (2007)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Kirpal, A.: Efficient Set Joins on Similarity Predicates. In: Proc. SIGMOD Conf., pp. 743\u2013754 (2004)","DOI":"10.1145\/1007568.1007652"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate String Matching with q-grams and Maximal Matches. Theor. Comput. Science\u00a092(1), 191\u2013211 (1992)","journal-title":"Theor. Comput. Science"},{"issue":"6","key":"18_CR15","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple Fast Algorithms for the Editing Distance Between Trees and related Problems. SIAM Journal on Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85713-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:19:33Z","timestamp":1738336773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85713-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857129","9783540857136"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85713-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}