{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:46:41Z","timestamp":1725565601639},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156830"},{"type":"electronic","value":"9783642156847"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15684-7_2","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T06:16:37Z","timestamp":1284531397000},"page":"3-17","source":"Crossref","is-referenced-by-count":3,"title":["Approximate Joins for XML Using g-String"],"prefix":"10.1007","author":[{"given":"Fei","family":"Li","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Augsten, N., B\u00f6hlen, M.H., Dyreson, C.E., Gamper, J.: Approximate joins for data-centric xml. In: ICDE, pp. 814\u2013823 (2008)","DOI":"10.1109\/ICDE.2008.4497490"},{"key":"2_CR2","unstructured":"Augsten, N., B\u00f6hlen, M.H., Gamper, J.: Approximate matching of hierarchical data using pq-grams. In: VLDB, pp. 301\u2013312 (2005)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Augsten, N., B\u00f6hlen, M.H., Gamper, J.: The pq-gram distance between ordered labeled trees. ACM Trans. Database Syst.\u00a035(1) (2010)","DOI":"10.1145\/1670243.1670247"},{"issue":"1-3","key":"2_CR4","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":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73420-8_15","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 146\u2013157. Springer, Heidelberg (2007)"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/1061318.1061326","volume":"30","author":"M.N. Garofalakis","year":"2005","unstructured":"Garofalakis, M.N., Kumar, A.: Xml stream processing using tree-edit distance embeddings. ACM Trans. Database Syst.\u00a030(1), 279\u2013332 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate xml joins. In: SIGMOD Conference, pp. 287\u2013298 (2002)","DOI":"10.1145\/564691.564725"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/978-3-540-24741-8_39","volume-title":"Advances in Database Technology - EDBT 2004","author":"K. Kailing","year":"2004","unstructured":"Kailing, K., Kriegel, H.-P., Sch\u00f6nauer, S., Seidl, T.: Efficient similarity search for hierarchical data in large databases. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 676\u2013693. Springer, Heidelberg (2004)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms - ESA \u201998","author":"P.N. Klein","year":"1998","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 91\u2013102. Springer, Heidelberg (1998)"},{"key":"2_CR10","unstructured":"Kuboyama, T.: Matching and Learning in Trees (2007)"},{"issue":"4","key":"2_CR11","first-page":"309","volume":"6","author":"B.A. Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple rna secondary structures using tree comparisons. Computer Applications in the Biosciences\u00a06(4), 309\u2013318 (1990)","journal-title":"Computer Applications in the Biosciences"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. J. ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"2_CR13","unstructured":"Tatikonda, S., Parthasarathy, S.: Hashing Tree-Structured Data: Methods and Applications. In: ICDE (to appear, 2010)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Valiente, G.: An efficient bottom-up distance between trees. In: SPIRE, pp. 212\u2013219 (2001)","DOI":"10.1109\/SPIRE.2001.989761"},{"key":"2_CR15","volume-title":"Information Retrieval","author":"C.J. Rijsbergen van","year":"1979","unstructured":"van Rijsbergen, C.J.: Information Retrieval. Butterworth, London (1979)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: SIGMOD Conference, pp. 754\u2013765 (2005)","DOI":"10.1145\/1066157.1066243"},{"issue":"6","key":"2_CR17","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 J. Comput.\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Database and XML Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15684-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:02:31Z","timestamp":1553094151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15684-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156830","9783642156847"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15684-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}