{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:48Z","timestamp":1760596248809},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T00:00:00Z","timestamp":1448323200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11704-015-4505-3","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T17:04:11Z","timestamp":1448384651000},"page":"317-329","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient graph similarity join for information integration on graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Yue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"key":"4505_CR1","first-page":"834","volume-title":"In: Proceedings of the 28th IEEE International Conference on Data Engineer.","author":"X Zhao","year":"2012","unstructured":"Zhao X, Xiao C, Lin X, Wang W. Efficient graph similarity joins with edit distance constraints. In: Proceedings of the 28th IEEE International Conference on Data Engineer. 2012, 834\u2013845"},{"key":"4505_CR2","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1145\/1989323.1989431","volume-title":"In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data.","author":"J Qin","year":"2011","unstructured":"Qin J, Wang W, Lu Y, Xiao C, Lin X. Efficient exact edit similarity query processing with the asymmetric signature schemes. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data. 2011, 1033\u20131044"},{"issue":"1","key":"4505_CR3","first-page":"264","volume":"3","author":"W Fan","year":"2011","unstructured":"Fan W, Li J, Ma S, Tang N, Wu Y. Graph pattern matching: from intractable to polynomial time. Proceedings of the VLDB Endowment, 2011, 3(1): 264\u2013275","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"4505_CR4","doi-asserted-by":"crossref","first-page":"310","DOI":"10.14778\/2095686.2095690","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma S, Cao Y, FanW, Huai J, Wo T. Capturing topology in graph pattern matching. Proceedings of the VLDB Endowment, 2011, 5(4): 310\u2013321","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"4505_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu K S. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics, 1983, 13(3): 353\u2013362","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"4","key":"4505_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke H, Allermann G. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters, 1983, 1(4): 245\u2013253","journal-title":"Pattern Recognition Letters"},{"key":"4505_CR7","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.patrec.2015.02.004","volume":"58","author":"K Gouda","year":"2015","unstructured":"Gouda K, Arafa M. An improved global lower bound for graph edit similarity search. Pattern Recognition Letters, 2015 58: 8\u201314","journal-title":"Pattern Recognition Letters"},{"key":"4505_CR8","volume-title":"Fachrichtung 6.2 \u2014 Informatik","author":"R Ibragimov","year":"2015","unstructured":"Ibragimov R. Exact and heuristic algorithms for network alignment using graph edit distance models. Dissertation for the Doctoral Degree. Fachrichtung 6.2 \u2014 Informatik, 2015"},{"key":"4505_CR9","first-page":"277","volume-title":"In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation","author":"J Baumbach","year":"2014","unstructured":"Baumbach J, Guo J, Ibragimov R. Multiple graph edit distance: simultaneous topological alignment of multiple protein\u2013protein interaction networks with an evolutionary algorithm. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation. 2014: 277\u2013284"},{"issue":"8","key":"4505_CR10","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D Justice","year":"2006","unstructured":"Justice D, Hero A. A binary linear programming formulation of the graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(8): 1200\u20131214","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"4505_CR11","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/978-3-642-20844-7_11","volume-title":"In: Proceedings of the 8th International Workshop on Graph\u2013Based Representations in Pattern Recognition.","author":"S Fankhauser","year":"2011","unstructured":"Fankhauser S, Riesen K, Bunke H. Speeding up graph edit distance computation through fast bipartite matching. In: Proceedings of the 8th International Workshop on Graph\u2013Based Representations in Pattern Recognition. 2011, 102\u2013111"},{"issue":"3","key":"4505_CR12","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TKDE.2010.28","volume":"24","author":"G Wang","year":"2012","unstructured":"Wang G, Wang B, Yang X, G. Yu G. Efficiently indexing large sparse graphs for similarity search. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(3): 440\u2013451","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"4505_CR13","first-page":"38","volume-title":"In: Proceedings of the International Conference of Young Computer Scientists, Engineers and Educators.","author":"Y Wang","year":"2015","unstructured":"Wang Y, Wang H, Li J, Gao H. Graph similarity join with k\u2013hop tree indexing. In: Proceedings of the International Conference of Young Computer Scientists, Engineers and Educators. 2015, 38\u201347"},{"issue":"8","key":"4505_CR14","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"M J Zaki","year":"2005","unstructured":"Zaki M J. Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(8): 1021\u20131035","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"4505_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X. A survey of graph edit distance. Pattern Analysis and Applications, 2010, 13(1): 113\u2013129","journal-title":"Pattern Analysis and Applications"},{"key":"4505_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-642-38221-5_9","volume-title":"In: Proceedings of the 9th International Workshop on Graph\u2013Based Representations in Pattern Recognition.","author":"D Conte","year":"2013","unstructured":"Conte D, Ramel JY, Sid\u00e8re N, Luqman MM, Ga\u00fcz\u00e8re B, Gibert J, Brun L, Vento M. A comparison of explicit and implicit graph embedding methods for pattern recognition. In: Proceedings of the 9th International Workshop on Graph\u2013Based Representations in Pattern Recognition. 2013, 81\u201390"},{"issue":"8","key":"4505_CR17","doi-asserted-by":"crossref","first-page":"838","DOI":"10.14778\/2757807.2757809","volume":"8","author":"Y Shao","year":"2015","unstructured":"Shao Y, Cui B, Chen L, Liu M, Xie X. An efficient similarity search framework for SimRank over large dynamic graphs. Proceedings of the VLDB Endowment, 2015, 8(8): 838\u2013849","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"4505_CR18","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TKDE.2014.2327037","volume":"27","author":"Y C Shao","year":"2015","unstructured":"Shao Y, CuiM, Ma L. PAGE: a partition aware engine for parallel graph computation. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(2): 518\u2013530","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"14","key":"4505_CR19","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.14778\/2733085.2733097","volume":"7","author":"N Xu","year":"2014","unstructured":"Xu N, Chen L, Cui B. LogGP: a log\u2013based dynamic graph partitioning method. Proceedings of the VLDB Endowment, 2014, 7(14): 1917\u20131928","journal-title":"Proceedings of the VLDB Endowment"},{"key":"4505_CR20","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/2588555.2593665","volume-title":"In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data.","author":"Y Shao","year":"2014","unstructured":"Shao Y, Chen L, Cui B. Efficient cohesive subgraphs detection in parallel. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 2014, 613\u2013624"},{"key":"4505_CR21","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/2588555.2588557","volume-title":"In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data.","author":"Y Shao","year":"2014","unstructured":"Shao Y, Cui B, Chen L, Ma L, Yao J, Xu N. Parallel subgraph listing in a large\u2013scale graph. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. 2014, 625\u2013636"},{"key":"4505_CR22","first-page":"823","volume-title":"In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management.","author":"Y Shao","year":"2013","unstructured":"Shao Y, Yao J, Cui B, Ma L. PAGE: a partition aware graph computation engine. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management. 2013, 823\u2013828"},{"issue":"1","key":"4505_CR23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1093\/nsr\/nwt020","volume":"1","author":"B Cui","year":"2014","unstructured":"Cui B, Mei H, Ooi B C. Big data: the driver for innovation in databases. National Science Review, 2014, 1 (1): 27\u201330","journal-title":"National Science Review"},{"key":"4505_CR24","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1145\/1807167.1807264","volume-title":"In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data.","author":"H Shang","year":"2010","unstructured":"Shang H, Lin X, Zhang Y, Yu J X, Wang W. Connected substructure similarity search. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. 2010, 903\u2013914"},{"key":"4505_CR25","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/1066157.1066244","volume-title":"In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data.","author":"X Yan","year":"2005","unstructured":"Yan X, Yu P S, Han J. Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. 2005, 766\u2013777"},{"issue":"3","key":"4505_CR26","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s00778-012-0292-8","volume":"22","author":"Y Zhu","year":"2013","unstructured":"Zhu Y, Qin L, Yu J X, Ke Y, Lin X. High efficiency and quality: large graphs matching. The VLDB Journal \u2014 The International Journal on Very Large Data Bases, 2013, 22(3): 345\u2013368","journal-title":"The VLDB Journal \u2014 The International Journal on Very Large Data Bases"},{"key":"4505_CR27","first-page":"976","volume-title":"In: Proceedings of the 23rd IEEE International Conference on Data Engineering.","author":"D W Williams","year":"2007","unstructured":"Williams D W, Huan J, Wang W. Graph database indexing using structured graph decomposition. In: Proceedings of the 23rd IEEE International Conference on Data Engineering. 2007, 976\u2013985"},{"issue":"1","key":"4505_CR28","doi-asserted-by":"crossref","first-page":"886","DOI":"10.14778\/1687627.1687727","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, \u00d6zsu M T. Distance\u2013join: pattern match query in a large graph databases. Proceedings of the VLDB Endowment, 2009, 2(1): 886\u2013897","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"4505_CR29","doi-asserted-by":"crossref","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng Z, Tung A K, Wang J, Feng J, Zhou L. Comparing stars: on approximating graph edit distance. Proceedings of the VLDB Endowment, 2009, 2(1): 25\u201336","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"7","key":"4505_CR30","doi-asserted-by":"crossref","first-page":"493","DOI":"10.14778\/2536349.2536350","volume":"6","author":"W Zheng","year":"2013","unstructured":"Zheng W, Zou L, Feng Y, Chen L, Zhao D. Efficient SimRank\u2013based similarity join over large graphs. Proceedings of the VLDB Endowment, 2013, 6(7): 493\u2013504","journal-title":"Proceedings of the VLDB Endowment"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-015-4505-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-015-4505-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-015-4505-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:23:47Z","timestamp":1653611027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-015-4505-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,24]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["4505"],"URL":"https:\/\/doi.org\/10.1007\/s11704-015-4505-3","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,24]]}}}