{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:50:01Z","timestamp":1725551401141},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120978"},{"type":"electronic","value":"9783642120985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12098-5_57","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T14:44:49Z","timestamp":1270651489000},"page":"487-488","source":"Crossref","is-referenced-by-count":9,"title":["Querying Large Graph Databases"],"prefix":"10.1007","author":[{"given":"Yiping","family":"Ke","sequence":"first","affiliation":[]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS, pp. 39\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"issue":"4","key":"57_CR2","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/1114244.1114248","volume":"30","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst.\u00a030(4), 960\u2013993 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"57_CR3","unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE, p. 38 (2006)"},{"key":"57_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, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE, pp. 966\u2013975 (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"57_CR6","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, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE, pp. 976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"57_CR8","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >= Graph. In: VLDB, pp. 938\u2013949 (2007)"},{"key":"57_CR9","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, pp. 181\u2013192 (2008)","DOI":"10.1145\/1353343.1353369"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. In: VLDB, pp. 364\u2013375 (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"57_CR11","unstructured":"Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.Q., Gu, X.: Towards graph containment search and indexing. In: VLDB, pp. 926\u2013937 (2007)"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, J., Gao, H., Zou, Z.: A novel approach for efficient supergraph query processing on graph databases. In: EDBT, pp. 204\u2013215 (2009)","DOI":"10.1145\/1516360.1516385"},{"key":"57_CR13","unstructured":"Holder, L., Cook, D., Djoko, S.: Substucture Discovery in the SUBDUE System. In: KDD Workshop, pp. 169\u2013180 (1994)"},{"issue":"6","key":"57_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","volume":"45","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: RASCAL: calculation of graph similarity using maximum common edge subgraphs. Comput. J.\u00a045(6), 631\u2013644 (2002)","journal-title":"Comput. J."},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: SIGMOD Conference, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Ke, Y., Cheng, J., Ng, W.: Correlation search in graph databases. In: KDD, pp. 390\u2013399 (2007)","DOI":"10.1145\/1281192.1281236"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Ke, Y., Cheng, J., Yu, J.X.: Top-k correlative graph mining. In: SDM, pp. 1038\u20131049 (2009)","DOI":"10.1137\/1.9781611972795.89"},{"key":"57_CR18","doi-asserted-by":"crossref","unstructured":"Ke, Y., Cheng, J., Yu, J.X.: Efficient discovery of frequent correlated subgraph pairs. In: ICDM, pp. 239\u2013248 (2009)","DOI":"10.1109\/ICDM.2009.54"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD, pp. 118\u2013127 (2004)","DOI":"10.1145\/1014052.1014068"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404\u2013413 (2006)","DOI":"10.1145\/1150402.1150448"},{"key":"57_CR21","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: KDD, pp. 245\u2013255 (2006)","DOI":"10.1145\/1150402.1150432"},{"key":"57_CR22","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Yu, J.X.: Context-aware object connection discovery in large graphs. In: ICDE, pp. 856\u2013867 (2009)","DOI":"10.1109\/ICDE.2009.87"},{"key":"57_CR23","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":"57_CR24","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"}],"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-12098-5_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:58Z","timestamp":1606186078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12098-5_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120978","9783642120985"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12098-5_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}