{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:03Z","timestamp":1725795843990},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080093"},{"type":"electronic","value":"9783319080109"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08010-9_23","type":"book-chapter","created":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T22:17:50Z","timestamp":1403129870000},"page":"208-212","source":"Crossref","is-referenced-by-count":0,"title":["Holistic Subgraph Search over Large Graphs"],"prefix":"10.1007","author":[{"given":"Peng","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongyan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","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.\u00a026(10) (2004)","DOI":"10.1109\/TPAMI.2004.75"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Han, W.-S., Lee, J., Lee, J.-H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD Conference, pp. 337\u2013348 (2013)","DOI":"10.1145\/2463676.2465300"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. In: PVLDB, vol.\u00a06(2), pp. 133\u2013144 (2012)","DOI":"10.14778\/2535568.2448946"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. In: PVLDB, vol.\u00a05(9) (2012)","DOI":"10.14778\/2311906.2311907"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023(1) (1976)","DOI":"10.1145\/321921.321925"},{"key":"23_CR6","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":"23_CR7","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. In: VLDB (2010)","DOI":"10.14778\/1920841.1920887"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08010-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:39:45Z","timestamp":1558924785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08010-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080093","9783319080109"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08010-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}