{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:52:28Z","timestamp":1725666748148},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642286346"},{"type":"electronic","value":"9783642286353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28635-3_11","type":"book-chapter","created":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T03:10:03Z","timestamp":1331089803000},"page":"124-135","source":"Crossref","is-referenced-by-count":1,"title":["Similarity Join on XML Based on k-Generation Set Distance"],"prefix":"10.1007","author":[{"given":"Yue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Augsten, N., Bohlen, M., Gamper, J.: Approximate matching of hierarchical data using pq-grams. In: Proc. of the 31st VLDB Conferences, Trondheim, Norway, pp. 301\u2013312 (2005)"},{"issue":"1-3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci.\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-16720-1_13","volume-title":"Web-Age Information Management","author":"F. Li","year":"2010","unstructured":"Li, F., Wang, H., Hao, L., Li, J., Gao, H.: pq-hash: An Efficient Method for Approximate XML Joins. In: Shen, H.T., Pei, J., \u00d6zsu, M.T., Zou, L., Lu, J., Ling, T.-W., Yu, G., Zhuang, Y., Shao, J. (eds.) WAIM 2010. LNCS, vol.\u00a06185, pp. 125\u2013134. Springer, Heidelberg (2010)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-15684-7_2","volume-title":"Database and XML Technologies","author":"F. Li","year":"2010","unstructured":"Li, F., Wang, H., Zhang, C., Hao, L., Li, J., Gao, H.: Approximate Joins for XML Using g-String. In: Lee, M.L., Yu, J.X., Bellahs\u00e8ne, Z., Unland, R. (eds.) XSym 2010. LNCS, vol.\u00a06309, pp. 3\u201317. Springer, Heidelberg (2010)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Augsten, N., Bohlen, M.H., Gamper, J.: The pq-gram distance between ordered labeled trees. ACM Trans. Database Syst.\u00a035(1) (2010)","DOI":"10.1145\/1670243.1670247"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Parthasarathy, S.: Hashing Tree-Structured Data: Methods and Applications. In: ICDE (2010) (to appear)","DOI":"10.1109\/ICDE.2010.5447882"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-44888-8_7","volume-title":"Combinatorial Pattern Matching","author":"S. Dulucq","year":"2003","unstructured":"Dulucq, S., Touzet, H.: Analysis of Tree Edit Distance Algorithms. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 83\u201395. Springer, Heidelberg (2003)"},{"key":"11_CR8","first-page":"81","volume":"suppl.","author":"Z. Han","year":"2009","unstructured":"Han, Z., Wang, H., Gao, H., Li, J., Luo, J.: Clustering-Based Approximate Join Method on XML Documents. Journal of Computer Research and Development\u00a0(suppl.), 81\u201386 (2009); ISSN:1000-1239\/CN 11-1177\/TP46","journal-title":"Journal of Computer Research and Development"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML Joins. ACM SIGMOD (June 4-6, 2002)","DOI":"10.1145\/564724.564725"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/1132863.1132868","volume":"31","author":"S. Guha","year":"2006","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Integrating XML Data Sources Using Approximate Joins. ACM Transactions on Database Systems\u00a031(1), 161\u2013207 (2006)","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28635-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:03:31Z","timestamp":1620111811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28635-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642286346","9783642286353"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28635-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}