{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:55:21Z","timestamp":1725551721523},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120251"},{"type":"electronic","value":"9783642120268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12026-8_13","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T13:56:08Z","timestamp":1270648568000},"page":"140-154","source":"Crossref","is-referenced-by-count":23,"title":["NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs"],"prefix":"10.1007","author":[{"given":"Ke","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaoping","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: SIGMOD Conference (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD Conference (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"13_CR5","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta >= graph. In: VLDB (2007)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen 0002, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT (2008)","DOI":"10.1145\/1353343.1353369"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB\u00a01(1) (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Dwork, C., Kleinberg, J.M.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: WWW (2007)","DOI":"10.1145\/1242572.1242598"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: ICPR (2) (2002)","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: EDBT (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"13_CR12","unstructured":"Human protein reference database, http:\/\/www.hprd.org\/download"},{"key":"13_CR13","unstructured":"The gene ontology, http:\/\/www.geneontology.org"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election. In: WWW 2005 Workshop on the Weblogging Ecosystem (2005)","DOI":"10.1145\/1134271.1134277"},{"key":"13_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11564126_17","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"J. Leskovec","year":"2005","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C.: Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 133\u2013145. Springer, Heidelberg (2005)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen 0002, L.: Continuous subgraph pattern search over graph streams. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.132"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Chen, J., Hsu, W., Lee, M.L., Ng, S.K.: Nemofinder: Dissecting genome-wide protein-protein interactions with meso-scale network motifs. In: KDD (2006)","DOI":"10.1145\/1150402.1150418"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph (2005)","DOI":"10.1137\/1.9781611972740.32"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Chen, C., Lin, C.X., Fredrikson, M., Christodorescu, M., Yan, X., Han, J.: Mining graph patterns efficiently via randomized summaries. In: VLDB (2009)","DOI":"10.14778\/1687627.1687711"}],"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-642-12026-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:37Z","timestamp":1606185997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12026-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120251","9783642120268"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12026-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}