{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:46:31Z","timestamp":1777639591878,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,3,13]],"date-time":"2022-03-13T00:00:00Z","timestamp":1647129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,13]],"date-time":"2022-03-13T00:00:00Z","timestamp":1647129600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702130"],"award-info":[{"award-number":["61702130"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"crossref","award":["2020GXNSFAA297186"],"award-info":[{"award-number":["2020GXNSFAA297186"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangxi Project of technology base and special talent","award":["AD19110022"],"award-info":[{"award-number":["AD19110022"]}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"crossref","award":["2020GXNSFAA159137"],"award-info":[{"award-number":["2020GXNSFAA159137"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangxi Science and Technology Major Project","award":["2018AA32001"],"award-info":[{"award-number":["2018AA32001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SIViP"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s11760-022-02166-7","type":"journal-article","created":{"date-parts":[[2022,3,13]],"date-time":"2022-03-13T13:02:32Z","timestamp":1647176552000},"page":"2045-2053","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Structure-Preserving Hashing for Tree-Structured Data"],"prefix":"10.1007","volume":"16","author":[{"given":"Zhi","family":"Xu","sequence":"first","affiliation":[]},{"given":"Lushuai","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Jianqiu","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Qinlin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,13]]},"reference":[{"issue":"4","key":"2166_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00778-011-0254-6","volume":"21","author":"N Augsten","year":"2012","unstructured":"Augsten, N., B\u00f6hlen, M.H., Dyreson, C.E., Gamper, J.: Windowed pq-grams for approximate joins of data-centric XML. VLDB J. 21(4), 463\u2013488 (2012)","journal-title":"VLDB J."},{"key":"2166_CR2","unstructured":"Augsten, N., B\u00f6hlen, M.H., Gamper, J.: Approximate matching of hierarchical data using pq-grams. In: Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005, pp. 301\u2013312. ACM (2005)"},{"issue":"1\u20133","key":"2166_CR3","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. 337(1\u20133), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2166_CR4","doi-asserted-by":"crossref","unstructured":"Bohman, T., Cooper, C., Frieze, A.M.: Min-wise independent linear permutations. Electron. J. Comb. 7 (2000)","DOI":"10.37236\/1504"},{"key":"2166_CR5","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of SEQUENCES 1997, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, Proceedings, pp. 21\u201329. IEEE (1997)"},{"key":"2166_CR6","unstructured":"Buttler, D.: A short survey of document structure similarity algorithms. In: Proceedings of the International Conference on Internet Computing, IC \u201904, Las Vegas, Nevada, USA, June 21-24, 2004, Volume 1, pp. 3\u20139. CSREA Press (2004)"},{"key":"2166_CR7","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 253\u2013262. ACM (2004)"},{"issue":"1","key":"2166_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/1061318.1061326","volume":"30","author":"MN Garofalakis","year":"2005","unstructured":"Garofalakis, M.N., Kumar, A.: XML stream processing using tree-edit distance embeddings. ACM Trans. Database Syst. 30(1), 279\u2013332 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"2166_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: Towards removing the curse of dimensionality. Theory Comput. 8(1), 321\u2013350 (2012)","journal-title":"Theory Comput."},{"issue":"11","key":"2166_CR10","doi-asserted-by":"publisher","first-page":"e0207772","DOI":"10.1371\/journal.pone.0207772","volume":"13","author":"AB Hassanat","year":"2018","unstructured":"Hassanat, A.B.: Two-point-based binary search trees for accelerating big data classification using knn. PloS one 13(11), e0207772 (2018)","journal-title":"PloS one"},{"issue":"3","key":"2166_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/big.2018.0064","volume":"6","author":"ABA Hassanat","year":"2018","unstructured":"Hassanat, A.B.A.: Furthest-pair-based binary search tree for speeding big data classification using k-nearest neighbors. Big Data 6(3), 225\u2013235 (2018)","journal-title":"Big Data"},{"issue":"11","key":"2166_CR12","first-page":"284","volume":"9","author":"ABA Hassanat","year":"2018","unstructured":"Hassanat, A.B.A.: Furthest-pair-based decision trees: Experimental results on big data classification. Inf. 9(11), 284 (2018)","journal-title":"Inf."},{"issue":"4","key":"2166_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.3390\/computers7040054","volume":"7","author":"ABA Hassanat","year":"2018","unstructured":"Hassanat, A.B.A.: Norm-based binary search trees for speeding up KNN big data classification. Comput. 7(4), 54 (2018)","journal-title":"Comput."},{"issue":"11","key":"2166_CR14","doi-asserted-by":"publisher","first-page":"4372","DOI":"10.1109\/TIP.2015.2451173","volume":"24","author":"J Ji","year":"2015","unstructured":"Ji, J., Li, J., Tian, Q., Yan, S., Zhang, B.: Angular-similarity-preserving binary signatures for linear subspaces. IEEE Trans. Image Process. 24(11), 4372\u20134380 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"2166_CR15","doi-asserted-by":"crossref","unstructured":"Ji, J., Li, J., Yan, S., Tian, Q., Zhang, B.: Min-max hash for jaccard similarity. In: 2013 IEEE 13th International Conference on Data Mining, Dallas, TX, USA, December 7-10, 2013, pp. 301\u2013309. IEEE Computer Society (2013)","DOI":"10.1109\/ICDM.2013.119"},{"issue":"10","key":"2166_CR16","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1109\/TPAMI.2014.2315806","volume":"36","author":"J Ji","year":"2014","unstructured":"Ji, J., Yan, S., Li, J., Gao, G., Tian, Q., Zhang, B.: Batch-orthogonal locality-sensitive hashingfor angular similarity. IEEE Trans. Pattern Anal. Mach. Intell. 36(10), 1963\u20131974 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"2166_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"2166_CR18","unstructured":"Kimura, D., Kashima, H.: Fast computation of subpath kernel for trees. CoRR abs\/1206.4642 (2012)"},{"key":"2166_CR19","doi-asserted-by":"crossref","unstructured":"Li, P., K\u00f6nig, A.C.: b-bit minwise hashing. In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, Raleigh, North Carolina, USA, April 26-30, 2010, pp. 671\u2013680. ACM (2010)","DOI":"10.1145\/1772690.1772759"},{"issue":"2","key":"2166_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/TKDE.2010.239","volume":"24","author":"Z Lin","year":"2012","unstructured":"Lin, Z., Wang, H., McClean, S.I.: A multidimensional sequence approach to measuring tree similarity. IEEE Trans. Knowl. Data Eng. 24(2), 197\u2013208 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"14","key":"2166_CR21","doi-asserted-by":"publisher","first-page":"i127","DOI":"10.1093\/bioinformatics\/btz354","volume":"35","author":"G Mar\u00e7ais","year":"2019","unstructured":"Mar\u00e7ais, G., DeBlasio, D.F., Pandey, P., Kingsford, C.: Locality-sensitive hashing for the edit distance. Bioinform. 35(14), i127\u2013i135 (2019)","journal-title":"Bioinform."},{"issue":"2","key":"2166_CR22","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jda.2005.01.010","volume":"5","author":"D Shapira","year":"2007","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. J. Discrete Algorithms 5(2), 380\u2013392 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"2166_CR23","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"2166_CR24","doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Parthasarathy, S.: Hashing tree-structured data: Methods and applications. In: Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, March 1-6, 2010, Long Beach, California, USA, pp. 429\u2013440. IEEE Computer Society (2010)","DOI":"10.1109\/ICDE.2010.5447882"},{"key":"2166_CR25","unstructured":"Teixeira, C.H.C., Silva, A., Jr, W.M.: Min-hash fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression. J. Inf. Data Manag. 3(3), 227\u2013242 (2012)"},{"issue":"5","key":"2166_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K Zhang","year":"1994","unstructured":"Zhang, K., Jiang, T.: Some MAX snp-hard results concerning unordered labeled trees. Inf. Process. Lett. 49(5), 249\u2013254 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2166_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.E.: On the editing distance between unordered labeled trees. Inf. Process. Lett. 42(3), 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."},{"key":"2166_CR28","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.knosys.2016.01.022","volume":"97","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Ji, J., Zhu, J., Li, J., Xu, H., Zhang, B.: Bithash: An efficient bitwise locality sensitive hashing method with applications. Knowl. Based Syst. 97, 40\u201347 (2016)","journal-title":"Knowl. Based Syst."}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-022-02166-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11760-022-02166-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-022-02166-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T05:18:52Z","timestamp":1664515132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11760-022-02166-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,13]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["2166"],"URL":"https:\/\/doi.org\/10.1007\/s11760-022-02166-7","relation":{},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"value":"1863-1703","type":"print"},{"value":"1863-1711","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,13]]},"assertion":[{"value":"3 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}