{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:17:35Z","timestamp":1772846255781,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007568.1007607","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"335-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":440,"title":["Graph indexing"],"prefix":"10.1145","author":[{"given":"Xifeng","family":"Yan","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.954600"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844706"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872776"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564706"},{"key":"e_1_3_2_1_5_1","first-page":"341","volume-title":"Proc. 2001 Int. Conf. Very Large Data Bases (VLDB '01)","author":"Cooper B.","year":"2001","unstructured":"B. Cooper , N. Sample , M. J. Franklin , G. R. Hjaltason , and M. Shadmon . A fast index for semistructured data . In Proc. 2001 Int. Conf. Very Large Data Bases (VLDB '01) , pages 341 -- 350 , 2001 .]] B. Cooper, N. Sample, M. J. Franklin, G. R. Hjaltason, and M. Shadmon. A fast index for semistructured data. In Proc. 2001 Int. Conf. Very Large Data Bases (VLDB '01), pages 341--350, 2001.]]"},{"key":"e_1_3_2_1_6_1","first-page":"436","volume-title":"Proc. 1997 Int. Conf. Very Large Data Bases (VLDB '97)","author":"Goldman R.","year":"1997","unstructured":"R. Goldman and J. Widom . Dataguides: Enabling query formulation and optimization in semistructured databases . In Proc. 1997 Int. Conf. Very Large Data Bases (VLDB '97) , pages 436 -- 445 , 1997 .]] R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In Proc. 1997 Int. Conf. Very Large Data Bases (VLDB '97), pages 436--445, 1997.]]"},{"key":"e_1_3_2_1_7_1","first-page":"13","volume-title":"Proc. 2000 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'00)","author":"Inokuchi A.","year":"1998","unstructured":"A. Inokuchi , T. Washio , and H. Motoda . An apriori-based algorithm for mining frequent substructures from graph data . In Proc. 2000 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'00) , pages 13 -- 23 , Lyon, France , Sept. 1998 .]] A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. 2000 European Symp. Principle of Data Mining and Knowledge Discovery (PKDD'00), pages 13--23, Lyon, France, Sept. 1998.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"Daylight Chemical Information Systems","author":"James C. A.","year":"2003","unstructured":"C. A. James , D. Weininger , and J. Delany . Daylight theory manual daylight version 4.82 . Daylight Chemical Information Systems , Inc , 2003 .]] C. A. James, D. Weininger, and J. Delany. Daylight theory manual daylight version 4.82. Daylight Chemical Information Systems, Inc, 2003.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. 2000 Int. Conf. Data Engineering ICDE'00)","author":"Shenoy R. Kaushik P.","year":"2002","unstructured":"R. Kaushik P. Shenoy , P. Bohannon , and E. Gudes . Exploiting local similarity for efficient indexing of paths in graph structured data . In Proc. 2000 Int. Conf. Data Engineering ICDE'00) , San Jose, CA , Feb. 2002 .]] R. Kaushik P. Shenoy, P. Bohannon, and E. Gudes. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proc. 2000 Int. Conf. Data Engineering ICDE'00), San Jose, CA, Feb. 2002.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_11_1","first-page":"289","article-title":"Threading a database of protein cores","volume":"3","author":"Madej T.","year":"1995","unstructured":"T. Madej , J. F. Gibrat , and S. H. Bryant . Threading a database of protein cores . Proteins , 3-2 : 289 -- 306 , 1995 .]] T. Madej, J. F. Gibrat, and S. H. Bryant. Threading a database of protein cores. Proteins, 3-2:289--306, 1995.]]","journal-title":"Proteins"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645503.656266"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.599932"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1999.784726"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315535"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844749"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.1997.641603"},{"key":"e_1_3_2_1_20_1","first-page":"721","volume-title":"Proc. 2002 Int. Conf. on Data Mining (ICDM'02)","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han , gSpan: Graph-based substructure pattern mining . In Proc. 2002 Int. Conf. on Data Mining (ICDM'02) , pages 721 -- 724 , Maebashi, Japan , Dec. 2002 .]] X. Yan and J. Han, gSpan: Graph-based substructure pattern mining. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), pages 721--724, Maebashi, Japan, Dec. 2002.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956788"}],"event":{"name":"SIGMOD\/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Paris France","acronym":"SIGMOD\/PODS04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2004 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007568.1007607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:32Z","timestamp":1750264292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007607"}},"subtitle":["a frequent structure-based approach"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":22,"alternative-id":["10.1145\/1007568.1007607","10.1145\/1007568"],"URL":"https:\/\/doi.org\/10.1145\/1007568.1007607","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}