{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T02:33:11Z","timestamp":1750818791716},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319058122"},{"type":"electronic","value":"9783319058139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05813-9_11","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T11:57:50Z","timestamp":1397649470000},"page":"156-170","source":"Crossref","is-referenced-by-count":10,"title":["Top-k Similarity Matching in Large Graphs with Attributes"],"prefix":"10.1007","author":[{"given":"Xiaofeng","family":"Ding","sequence":"first","affiliation":[]},{"given":"Jianhong","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Jiuyong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jixue","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","first-page":"1","volume-title":"TKDE","author":"T. Tassa","year":"2011","unstructured":"Tassa, T., Cohen, D.: Anonymization of Centralized and Distributed Social Networks by Sequential Clustering. In: TKDE, pp. 1\u201314. IEEE Press, New York (2011)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: An Algorithm for Subgraph Isomorphism. J. ACM, 31\u201342 (1976)","DOI":"10.1145\/321921.321925"},{"key":"11_CR3","first-page":"43","volume-title":"Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs","author":"L.P. Cordella","year":"1998","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs, pp. 43\u201352. Springer, Vienna (1998)"},{"key":"11_CR4","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An Improved Algorithm for Matching Large Graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 149\u2013159 (2001)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism. In: VLDB, pp. 364\u2013375 (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"11_CR6","first-page":"39","volume-title":"PODS","author":"D. Shasha","year":"2002","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: PODS, pp. 39\u201352. ACM Press, New York (2002)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1145\/1247480.1247574","volume-title":"SIGMOD","author":"J. Cheng","year":"2007","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: FG-Index: Towards Verification-Free Query Processing on Graph Databases. In: SIGMOD, pp. 857\u2013872. ACM Press, New York (2007)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/1007568.1007607","volume-title":"SIGMOD","author":"X. Yan","year":"2004","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph Indexing: A Frequent Structure-based Approach. In: SIGMOD, pp. 335\u2013346. ACM Press, New York (2004)"},{"key":"11_CR9","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Iindexing: Tree+ Delta >\u2009= Graph. In: VLDB, pp. 938\u2013949 (2007)"},{"key":"11_CR10","first-page":"38","volume-title":"ICDE","author":"H. He","year":"2006","unstructured":"He, H., Singh, A.K.: Closure-Tree: An Index Structure for Graph Queries. In: ICDE, pp. 38\u201349. IEEE Press, New York (2006)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal Aggregation Algorithms for Middleware. In: PODS, pp. 102\u2013113 (2001)","DOI":"10.1145\/375551.375567"},{"key":"11_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"11_CR13","unstructured":"Han, J., Kamber, M., Pei, J.: Data mining: Concepts and Techniques. Morgan Kaufmann (2006)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Tong, H., Gallagher, B., Faloutsos, C., Eliassi-Rad, T.: Fast Best-Effort Pattern Matching in Large Attributed Graphs. In: ACM KDD, New York, pp. 737\u2013746 (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Amin, M.S., Finley Jr., R.L., Jamil, H.M.: Top-k Similar Graph Matching Using TraM in Biological Networks. In: TCBB, New York, pp. 1790\u20131804 (2012)","DOI":"10.1109\/TCBB.2012.90"},{"key":"11_CR16","first-page":"440","volume-title":"TKDE","author":"G. Wang","year":"2012","unstructured":"Wang, G., Wang, B., Yang, X., Yu, G.: Efficiently Indexing Large Sparse Graphs for Similarity Search. In: TKDE, pp. 440\u2013451. IEEE Press, New York (2012)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Mongiovi, M., Natale, R.D., Giugno, R., Pulvirenti, A., Ferro, A.: Sigma: A Set-Cover-Based Inexact Graph Matching Algorithm. Journal of Bioinformatics and Computational Biology, 199\u2013218 (2010)","DOI":"10.1142\/S021972001000477X"},{"key":"11_CR18","first-page":"637","volume-title":"ICDE","author":"H. Shang","year":"2004","unstructured":"Shang, H., Zhu, K., Lin, X., Zhang, Y., Ichise, R.: Similarity Search on Supergraph Containment. In: ICDE, pp. 637\u2013648. IEEE Press, New York (2004)"},{"key":"11_CR19","first-page":"210","volume-title":"ICDE","author":"X. Wang","year":"2012","unstructured":"Wang, X., Ding, X., Tung, A.K.H., Ying, S., Jin, H.: An Efficient Graph Indexing Method. In: ICDE, pp. 210\u2013221. IEEE Press, New York (2012)"},{"key":"11_CR20","first-page":"834","volume-title":"ICDE","author":"X. Zhao","year":"2012","unstructured":"Zhao, X., Xiao, C., Lin, X., Wang, W.: Efficient Graph Similarity Joins with Edit Distance Constraints. In: ICDE, pp. 834\u2013845. IEEE Press, New York (2012)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing Stars: On Approximating Graph Edit Distance. In: VLDB, pp. 25\u201336 (2009)","DOI":"10.14778\/1687627.1687631"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Khan, A., Li, N., Yan, X., Guan, Z., Chakraborty, S., Tao, S.: Neighborhood Based Fast Graph Search in Large Networks. In: SIGMOD, New York, pp. 901\u2013912 (2011)","DOI":"10.1145\/1989323.1989418"},{"key":"11_CR23","first-page":"963","volume-title":"ICDE","author":"Y. Tian","year":"2008","unstructured":"Tian, Y., Patel, J.M.: TALE: A Tool for Approximate Large Graph Matching. In: ICDE, pp. 963\u2013972. IEEE Press, New York (2008)"},{"key":"11_CR24","first-page":"903","volume-title":"SIGMOD","author":"H. Shang","year":"2010","unstructured":"Shang, H., Lin, X., Zhang, Y., Yu, J.X., Wang, W.: Connected Substructure Similarity Search. In: SIGMOD, pp. 903\u2013914. ACM Press, New York (2010)"},{"key":"11_CR25","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/1066157.1066244","volume-title":"SIGMOD","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure Similarity Search in Graph Databases. In: SIGMOD, pp. 766\u2013777. ACM Press, New York (2005)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K., Zhang, W., Yu, J.X.: TreeSpan: Efficiently Computing Similarity All-Matching. In: SIGMOD, New York, pp. 529\u2013540 (2012)","DOI":"10.1145\/2213836.2213896"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient Subgraph Matching on Billion Node Graphs. In: VLDB, pp. 788\u2013799 (2012)","DOI":"10.14778\/2311906.2311907"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Lu, Y.: Top-K Subgraph Matching Query in A Large Graph. In: CIKM, pp. 139\u2013146 (2007)","DOI":"10.1145\/1316874.1316897"},{"key":"11_CR29","unstructured":"Kriege, N., Mutzel, P.: Subgraph Matching Kernels for Attributed Graphs. In: ICML, pp. 1\u20138 (2012)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05813-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T05:21:53Z","timestamp":1689139313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05813-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058122","9783319058139"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05813-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}