{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:55Z","timestamp":1759205335693},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T00:00:00Z","timestamp":1292457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s00778-010-0212-8","type":"journal-article","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T13:41:03Z","timestamp":1292420463000},"page":"521-539","source":"Crossref","is-referenced-by-count":35,"title":["Fast graph query processing with a low-cost index"],"prefix":"10.1007","volume":"20","author":[{"given":"James","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiping","family":"Ke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"key":"212_CR1","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: PODS, pp. 1\u201316. (2002)","DOI":"10.1145\/543613.543615"},{"key":"212_CR2","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":"212_CR3","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 Conference, pp. 857\u2013872. (2007)","DOI":"10.1145\/1247480.1247574"},{"issue":"2","key":"212_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/776985.776986","volume":"32","author":"L. Golab","year":"2003","unstructured":"Golab L., \u00d6zsu M.T.: Issues in data stream management. SIGMOD Rec. 32(2), 5\u201314 (2003)","journal-title":"SIGMOD Rec."},{"key":"212_CR5","unstructured":"He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: ICDE, pp. 38. (2006)"},{"key":"212_CR6","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J., Tropsha A.: Mining protein family specific residue packing patterns from protein structure graphs. In: RECOMB, pp. 308\u2013315. (2004)","DOI":"10.1145\/974614.974655"},{"key":"212_CR7","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp. 581\u2013586. (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"212_CR8","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: PKDD, pp. 13\u201323. (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"key":"212_CR9","volume-title":"Daylight theory manual daylight version 4.82","author":"C.A. James","year":"2003","unstructured":"James C.A., Weininger D., Delany J.: Daylight theory manual daylight version 4.82. Daylight Chemical Information Systems Inc., Irvine, CA (2003)"},{"key":"212_CR10","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":"212_CR11","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":"212_CR12","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, (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"212_CR13","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\/543619.543620"},{"key":"212_CR14","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"},{"issue":"2","key":"212_CR15","first-page":"27","volume":"23","author":"T. Urhan","year":"2000","unstructured":"Urhan T., Franklin M.J.: Xjoin: a reactively-scheduled pipelined join operator. IEEE Data Eng. Bull. 23(2), 27\u201333 (2000)","journal-title":"IEEE Data Eng. Bull."},{"key":"212_CR16","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":"212_CR17","unstructured":"Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB, pp. 709\u2013720. (2005)"},{"key":"212_CR18","unstructured":"Yan, X., Han, J.: gspan: graph-based substructure pattern mining. In: ICDM, pp. 721\u2013724. (2002)"},{"key":"212_CR19","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: KDD, pp. 286\u2013295. (2003)","DOI":"10.1145\/956755.956784"},{"issue":"4","key":"212_CR20","doi-asserted-by":"crossref","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. 30(4), 960\u2013993 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"212_CR21","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":"212_CR22","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":"212_CR23","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: tree + delta >= graph. In: VLDB, pp. 938\u2013949. (2007)"},{"key":"212_CR24","doi-asserted-by":"crossref","unstructured":"Zou, L., 0002, L.C., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181\u2013192. (2008)","DOI":"10.1145\/1352431.1352457"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0212-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-010-0212-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0212-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T23:30:54Z","timestamp":1559863854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-010-0212-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["212"],"URL":"https:\/\/doi.org\/10.1007\/s00778-010-0212-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,16]]}}}