{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:36:50Z","timestamp":1725568610552},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642167195"},{"type":"electronic","value":"9783642167201"}],"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-16720-1_13","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:40:14Z","timestamp":1288705214000},"page":"125-134","source":"Crossref","is-referenced-by-count":1,"title":["pq-Hash: An Efficient Method for Approximate XML Joins"],"prefix":"10.1007","author":[{"given":"Fei","family":"Li","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","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":"13_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":"13_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":"13_CR3","unstructured":"Augsten, N., B\u00f6hlen, M.H., Gamper, J.: An incrementally maintainable index for approximate lookups in hierarchical data. In: VLDB, pp. 247\u2013258 (2006)"},{"issue":"1-3","key":"13_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":"13_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations (extended abstract). In: STOC, pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cobena, G., Abiteboul, S., Marian, A.: Detecting changes in XML documents. In: ICDE, pp. 41\u201352 (2002)","DOI":"10.1109\/ICDE.2002.994696"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/69.908981","volume":"13","author":"E. Cohen","year":"2001","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng.\u00a013(1), 64\u201378 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR8","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)"},{"key":"13_CR9","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB, pp. 518\u2013529 (1999)"},{"key":"13_CR10","unstructured":"Haveliwala, T.H., Gionis, A., Indyk, P.: Scalable techniques for clustering the web. In: WebDB (Informal Proceedings), pp. 129\u2013134 (2000)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM Journal of Research and Development"},{"key":"13_CR12","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)"},{"issue":"8","key":"13_CR13","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1109\/TKDE.2004.19","volume":"16","author":"K.-H. Lee","year":"2004","unstructured":"Lee, K.-H., Choy, Y.-C., Cho, S.-B.: An efficient algorithm to compute differences between structured documents. IEEE Trans. Knowl. Data Eng.\u00a016(8), 965\u2013979 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: Detectives: detecting coalition hit inflation attacks in advertising networks streams. In: WWW, pp. 241\u2013250 (2007)","DOI":"10.1145\/1242572.1242606"},{"issue":"3","key":"13_CR15","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"},{"issue":"6","key":"13_CR16","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","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16720-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:04:33Z","timestamp":1559783073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16720-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642167195","9783642167201"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16720-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}