{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:29:38Z","timestamp":1783700978300,"version":"3.55.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319425528","type":"print"},{"value":"9783319425535","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42553-5_21","type":"book-chapter","created":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T11:42:23Z","timestamp":1468842143000},"page":"247-256","source":"Crossref","is-referenced-by-count":3,"title":["Approximate Subgraph Matching Query over Large Graph"],"prefix":"10.1007","author":[{"given":"Yu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tingting","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaofeng","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Barcel, P., Libkin, L., Reutter, J.L.: Querying graph patterns. In: Proceedings of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 199\u2013210 (2011)","DOI":"10.1145\/1989284.1989307"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bayati, M., Gerritsen, M., Gleich, D.F., Saberi, A., Wang, Y.: Algorithms for large, sparse network alignment problems. In: Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 705\u2013710. IEEE (2009)","DOI":"10.1109\/ICDM.2009.135"},{"issue":"10","key":"21_CR3","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Advances in Database Systems, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"issue":"12","key":"21_CR5","doi-asserted-by":"crossref","first-page":"W83","DOI":"10.1093\/nar\/gkh411","volume":"32","author":"BP Kelley","year":"2004","unstructured":"Kelley, B.P., Yuan, B., Lewitter, F., Sharan, R., Stockwell, B.R., Ideker, T.: Pathblast: a tool for alignment of protein interaction networks. Nucleic Acids Res. 32(12), W83\u2013W88 (2004)","journal-title":"Nucleic Acids Res."},{"key":"21_CR6","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: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 901\u2013912 (2011)","DOI":"10.1145\/1989323.1989418"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.14778\/2535569.2448952","volume":"6","author":"A Khan","year":"2013","unstructured":"Khan, A., Wu, Y., Aggarwal, C.C., Yan, X.: Nema: fast graph search with label similarity. Proc. VLDB Endowment 6, 181\u2013192 (2013). VLDB Endowment","journal-title":"Proc. VLDB Endowment"},{"issue":"17","key":"21_CR8","doi-asserted-by":"crossref","first-page":"2175","DOI":"10.1093\/bioinformatics\/btl287","volume":"22","author":"Z Liang","year":"2006","unstructured":"Liang, Z., Xu, M., Teng, M., Niu, L.: Netalign: a web-based tool for comparison of protein interaction networks. Bioinformatics 22(17), 2175\u20132177 (2006)","journal-title":"Bioinformatics"},{"issue":"02","key":"21_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1142\/S021972001000477X","volume":"8","author":"M Mongiovi","year":"2010","unstructured":"Mongiovi, M., Di Natale, R., Giugno, R., Pulvirenti, A., Ferro, A., Sharan, R.: Sigma: a set-cover-based inexact graph matching algorithm. J. Bioinform. Comput. Biol. 8(02), 199\u2013218 (2010)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"21_CR10","unstructured":"PrudHommeaux, E., Seaborne, A., et al.: Sparql query language for rdf. W3C Recommendation 15 (2008)"},{"issue":"6","key":"21_CR11","first-page":"1037","volume":"131","author":"S Rohit","year":"2011","unstructured":"Rohit, S., Jinbo, X., Bonnie, B.: Global alignment of multiple protein interaction networks with application to functional orthology detection. Proc. Nat. Acad. Sci. 131(6), 1037\u20131047 (2011)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"9","key":"21_CR12","doi-asserted-by":"crossref","first-page":"788","DOI":"10.14778\/2311906.2311907","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. Proc. VLDB Endowment 5(9), 788\u2013799 (2012)","journal-title":"Proc. VLDB Endowment"},{"issue":"2","key":"21_CR13","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2007","unstructured":"Tian, Y., Mceachin, R.C., Santos, C., States, D.J., Patel, J.M.: Saga: a subgraph matching tool for biological graphs. Bioinformatics 23(2), 232\u2013239 (2007)","journal-title":"Bioinformatics"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.M.: Tale: a tool for approximate large graph matching. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 963\u2013972. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"issue":"7","key":"21_CR15","doi-asserted-by":"crossref","first-page":"565","DOI":"10.14778\/2732286.2732293","volume":"7","author":"S Yang","year":"2014","unstructured":"Yang, S., Wu, Y., Sun, H., Yan, X.: Schemaless and structureless graph querying. Proc. VLDB Endowment 7(7), 565\u2013576 (2014)","journal-title":"Proc. VLDB Endowment"},{"issue":"1\u20132","key":"21_CR16","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.14778\/1920841.1920988","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: Sapper: subgraph indexing and approximate matching in large graphs. Proc. VLDB Endowment 3(1\u20132), 1185\u20131194 (2010)","journal-title":"Proc. VLDB Endowment"},{"issue":"1\u20132","key":"21_CR17","doi-asserted-by":"crossref","first-page":"340","DOI":"10.14778\/1920841.1920887","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. Proc. VLDB Endowment 3(1\u20132), 340\u2013351 (2010)","journal-title":"Proc. VLDB Endowment"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Zhong, Q., Li, H., Li, J., Xie, G., Tang, J., Zhou, L., Pan, Y.: A gauss function based approach for unbalanced ontology matching. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, pp. 669\u2013680. ACM (2009)","DOI":"10.1145\/1559845.1559915"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: International Conference on Extending Database Technology, pp. 181\u2013192 (2008)","DOI":"10.1145\/1353343.1353369"}],"container-title":["Lecture Notes in Computer Science","Big Data Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42553-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:38:40Z","timestamp":1498329520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42553-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319425528","9783319425535"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42553-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}