{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T17:27:25Z","timestamp":1673026045275},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,25]],"date-time":"2015-01-25T00:00:00Z","timestamp":1422144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s11280-014-0322-0","type":"journal-article","created":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T08:44:23Z","timestamp":1422089063000},"page":"417-448","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Answering subgraph queries over massive disk resident graphs"],"prefix":"10.1007","volume":"19","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","published-online":{"date-parts":[[2015,1,25]]},"reference":[{"key":"322_CR1","doi-asserted-by":"crossref","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys., 74 (2002)","DOI":"10.1103\/RevModPhys.74.47"},{"key":"322_CR2","doi-asserted-by":"crossref","unstructured":"Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J. 16(3) (2007)","DOI":"10.1007\/s00778-005-0177-1"},{"key":"322_CR3","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":"322_CR4","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 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"322_CR5","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":"322_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5) (2003)","DOI":"10.1137\/S0097539702403098"},{"issue":"10","key":"322_CR7","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."},{"issue":"1","key":"322_CR8","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"key":"322_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: SIGMOD Conference, pp. 157\u2013168 (2012)","DOI":"10.1145\/2213836.2213855"},{"key":"322_CR10","doi-asserted-by":"crossref","unstructured":"Fan, W., Wang, X., Wu, Y.: Answering graph pattern queries using views. In: IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014, pp. 184\u2013195 (2014)","DOI":"10.1109\/ICDE.2014.6816650"},{"key":"322_CR11","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhou, C., Zhou, J., Yu, J.X.: Continuous pattern detection over billion-edge graph using distributed framework. In: IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, March 31 - April 4, 2014, pp. 556\u2013567 (2014)","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"322_CR12","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":"322_CR13","unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE (2006)"},{"key":"322_CR14","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD Conference, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"322_CR15","unstructured":"http:\/\/giraph.apache.org"},{"key":"322_CR16","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":"322_CR17","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. 10(3) (1998)","DOI":"10.1109\/69.687976"},{"key":"322_CR18","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: SIGMOD Conference, pp. 901\u2013912 (2011)","DOI":"10.1145\/1989323.1989418"},{"key":"322_CR19","doi-asserted-by":"crossref","unstructured":"Klein, K., Kriege, N., Mutzel, P.: Ct-index: Fingerprint-based graph indexing combining cycles and trees. In: ICDE, pp. 1115\u20131126 (2011)","DOI":"10.1109\/ICDE.2011.5767909"},{"issue":"2","key":"322_CR20","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.-S., Kasperovics, R., Lee, J.-H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133\u2013144 (2012)","journal-title":"PVLDB"},{"key":"322_CR21","unstructured":"Murty, K.G.: Network Programming. Prentice Hall (1992)"},{"key":"322_CR22","doi-asserted-by":"crossref","unstructured":"Sakr, S., Elnikety, S., He, Y.: G-sparql: a hybrid engine for querying large attributed graphs. In: CIKM, pp. 335\u2013344 (2012)","DOI":"10.1145\/2396761.2396806"},{"key":"322_CR23","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: a distributed graph engine on a memory cloud. In: SIGMOD Conference, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"key":"322_CR24","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"},{"issue":"9","key":"322_CR25","first-page":"788","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. PVLDB 5(9), 788\u2013799 (2012)","journal-title":"PVLDB"},{"key":"322_CR26","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 23(2) (2007)","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"322_CR27","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":"322_CR28","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD, pp. 737\u2013746 (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"322_CR29","doi-asserted-by":"crossref","unstructured":"TriSSl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"322_CR30","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1) (1976)","DOI":"10.1145\/321921.321925"},{"key":"322_CR31","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":"322_CR32","doi-asserted-by":"crossref","unstructured":"Williams, J. H. D.W., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"322_CR33","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"},{"issue":"7","key":"322_CR34","first-page":"565","volume":"7","author":"S Yang","year":"2014","unstructured":"Yang, S., Wu, Y., Sun, H., Yan, X.: Schemaless and structureless graph querying. PVLDB 7(7), 565\u2013576 (2014)","journal-title":"PVLDB"},{"issue":"1","key":"322_CR35","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: On approximating graph edit distance. PVLDB 2(1), 25\u201336 (2009)","journal-title":"PVLDB"},{"key":"322_CR36","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":"322_CR37","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"},{"issue":"1","key":"322_CR38","first-page":"1185","volume":"3","author":"S Zhang","year":"2010","unstructured":"Zhang, S., Yang, J., Jin, W.: Sapper: Subgraph indexing and approximate matching in large graphs. PVLDB 3(1), 1185\u20131194 (2010)","journal-title":"PVLDB"},{"key":"322_CR39","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":"322_CR40","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta >= graph. In: VLDB (2007)"},{"key":"322_CR41","doi-asserted-by":"crossref","unstructured":"Zheng, W., Zou, L., Lian, X., Wang, D., Zhao, D.: Graph similarity search with edit distance constraint in large graph databases. In: CIKM, pp. 1595\u20131600 (2013)","DOI":"10.1145\/2505515.2505723"},{"key":"322_CR42","doi-asserted-by":"crossref","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: DASFAA (1) (2010)","DOI":"10.1007\/978-3-642-12026-8_13"},{"issue":"1","key":"322_CR43","first-page":"886","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: Distancejoin: Pattern match query in a large graph database. PVLDB 2(1), 886\u2013897 (2009)","journal-title":"PVLDB"},{"key":"322_CR44","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT (2008)","DOI":"10.1145\/1353343.1353369"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0322-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-014-0322-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-014-0322-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T03:33:59Z","timestamp":1566272039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-014-0322-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,25]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["322"],"URL":"https:\/\/doi.org\/10.1007\/s11280-014-0322-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,25]]}}}