{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:47:15Z","timestamp":1743130035916,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223501"},{"type":"electronic","value":"9783642223518"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22351-8_18","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T13:46:41Z","timestamp":1310996801000},"page":"293-311","source":"Crossref","is-referenced-by-count":3,"title":["A Flexible Graph Pattern Matching Framework via Indexing"],"prefix":"10.1007","author":[{"given":"Wei","family":"Jin","sequence":"first","affiliation":[]},{"given":"Jiong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7) (1970)","DOI":"10.1145\/362686.362692"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X., Ding, B., Yu, P.S., Wang, H.: Fast graph pattern matching. In: Proc. of ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Christmas, W.J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE Trans. on PAMI\u00a017(8) (1995)","DOI":"10.1109\/34.400565"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM Journal of Computing\u00a032(5) (2003)","DOI":"10.1137\/S0097539702403098"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. on PAMI\u00a026(10) (2004)","DOI":"10.1109\/TPAMI.2004.75"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","DOI":"10.1007\/BF01386390"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Communications of the ACM\u00a05(6) (1961)","DOI":"10.1145\/367766.368168"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Giugno, R., Shasha, D.: GraphGrep: A fast and universal method for querying graphs. In: Proc. of ICPR (2002)","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"18_CR9","unstructured":"He, H., Singh, A.K.: Closure-Tree: An index structure for graph queries. In: Proc. of ICDE (2006)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1093\/nar\/28.1.27","volume":"28","author":"M. Kanehisa","year":"2000","unstructured":"Kanehisa, M., Goto, S.: KEGG: Kyoto encyclopedia of genes and genomes. Nuc. Ac. Res.\u00a028, 27\u201330 (2000)","journal-title":"Nuc. Ac. Res."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Nguyen, H., Pham, N., AI-Kofahi, J., Nguyen, T.: Graph-based mining of multiple object usage patterns. In: Proc. of the Joint Meeting of ESEC and ACM SIGSOFT (2009)","DOI":"10.1145\/1595696.1595767"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Starobinski, D., Trachtenberg, A., Agarwaln, S.: Efficient PDA synchronization. IEEE Trans. on Mobile Computing\u00a02(1) (2003)","DOI":"10.1109\/TMC.2003.1195150"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: Proc. of the KDD (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Ullmann, J.: An algorithm for subgraph isomorphism. Journal of the ACM (1976)","DOI":"10.1145\/321921.321925"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph Indexing, a Frequent Structure-based Approach. In: Proc. of Sigmod (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: Proc. of EDBT (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: a novel graph indexing method. In: Proc. of ICDE (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. In: Proc. of VLDB (2010)","DOI":"10.14778\/1920841.1920887"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Ozsu, M.T.: Distance-Join: pattern match query in a large graph database. In: Proc. of Int. Conf. on Very Large Data Bases (2009)","DOI":"10.14778\/1687627.1687727"},{"key":"18_CR20","unstructured":"Gene Ontology, http:\/\/www.geneontology.org\/"},{"key":"18_CR21","unstructured":"gengraph_win, http:\/\/www.cs.sunysb.edu\/\u00e3lgorith\/implement\/viger\/distrib\/"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22351-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T22:32:57Z","timestamp":1560378777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22351-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223501","9783642223518"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22351-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}