{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:48:36Z","timestamp":1738216116852,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_47","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"562-570","source":"Crossref","is-referenced-by-count":2,"title":["An Approach for XML Similarity Join Using Tree Serialization"],"prefix":"10.1007","author":[{"given":"Lianzi","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Kitagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"W3C: Extensible Markup Language (XML) 1.0 (Fourth Edition) (August 2006)Recommendation, \n                      \n                        http:\/\/www.w3.org\/TR\/REC-xml\/"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures. In: Proc. the 2003 ACM-SIGMOD Conference (SIGMOD), pp. 110\u2013121 (2003)","DOI":"10.1145\/872757.872774"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, N., Kacholia, V., Ozsu, M.T.: A succinct physical storage scheme for efficient evaluation of path queries in Xml. In: Proc. ICDE 2004, p. 54 (2004)","DOI":"10.1109\/ICDE.2004.1319984"},{"key":"47_CR4","unstructured":"Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proc. VLDB 2001, pp. 361\u2013370 (2001)"},{"key":"47_CR5","unstructured":"Liang, W., Yokota, H.: A Path-sequence Based Discrimination for Subtree Matching in Approximate XML Joins. In: Proc. The 2nd Int\u2019l Special Workshop on Databases for Next-Generation Researchers (SWOD) 2006, p. 116 (2006)"},{"key":"47_CR6","volume-title":"Tree pattern matching. Pattern Matching Algorithms","author":"K. Zhang","year":"1997","unstructured":"Zhang, K., Shasha, D.: Tree pattern matching. Pattern Matching Algorithms. In: Tree pattern matching. Pattern Matching Algorithms, vol.\u00a011, Oxford University Press, Oxford (1997)"},{"key":"47_CR7","unstructured":"Rao, P., Moon, B.: PRIX: Indexing And Querying XML Using Prufer Sequences. In: Proc. ICDE 2004, p. 288 (2004)"},{"key":"47_CR8","unstructured":"Gong, X., Qian, W., Yan, Y., Zhou, A.: Bloom Filter based XML Packets Filtering for Millions of Path Queries. In: Proc. ICDE 2005, pp. 890\u2013901 (2005)"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A Primitive Operator for Similarity Joins in Data Cleaning. In: Proc. ICDE 2006, p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:13:28Z","timestamp":1619522008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_47","relation":{},"subject":[]}}