{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:36:14Z","timestamp":1743053774355,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_19","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T13:46:41Z","timestamp":1310996801000},"page":"312-321","source":"Crossref","is-referenced-by-count":5,"title":["Subgraph Search over Massive Disk Resident 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":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongyan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J.\u00a016(3) (2007)","DOI":"10.1007\/s00778-005-0177-1"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, Y.: An efficient algorithm for answering graph reachability queries. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In: EDBT (2009)","DOI":"10.1145\/1516360.1516417"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput.\u00a032(5) (2003)","DOI":"10.1137\/S0097539702403098"},{"issue":"10","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L.P. 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.\u00a026(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Jiang, P.Y.H., Wang, H., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng.\u00a010(3) (1998)","DOI":"10.1109\/69.687976"},{"key":"19_CR8","unstructured":"Peng, P., Zou, L., Zhao, D., Chen, L., Lin, X.: Technical report, http:\/\/www.icst.pku.edu.cn\/intro\/leizou\/subgraphsearch.pdf"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)","DOI":"10.1145\/543613.543620"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Tian, Y., McEachin, R.C., Santos, C., States, D.J., Patel, J.M.: Saga: a subgraph matching tool for biological graphs. Bioinformatics\u00a023(2) (2007)","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: ICDE, pp. 963\u2013972 (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Tri\u00dfl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM\u00a023(1) (1976)","DOI":"10.1145\/321921.321925"},{"key":"19_CR14","unstructured":"Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: ICDE (2006)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: Gaddi: distance index based subgraph matching in biological networks. In: EDBT, pp. 192\u2013203 (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. In: VLDB (2010)","DOI":"10.14778\/1920841.1920887"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-12026-8_13","volume-title":"Database Systems for Advanced Applications","author":"K. Zhu","year":"2010","unstructured":"Zhu, K., Zhang, Y., Lin, X., Zhu, G., Wang, W.: NOVA: A novel and efficient framework for finding subgraph isomorphism mappings in large graphs. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol.\u00a05981, pp. 140\u2013154. Springer, Heidelberg (2010)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distancejoin: Pattern match query in a large graph database. PVLDB\u00a02(1)","DOI":"10.14778\/1687627.1687727"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T22:32:51Z","timestamp":1560378771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22351-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223501","9783642223518"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22351-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}