{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:58:45Z","timestamp":1773482325348,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"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":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066244","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"766-777","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":216,"title":["Substructure similarity search in graph databases"],"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":[[2005,6,14]]},"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.1093\/nar\/28.1.235"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"e_1_3_2_1_4_1","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"Hochbaum D.","year":"1997","unstructured":"D. Hochbaum (ed.). Approximation Algorithms for NP-Hard Problems . PWS Publishing , MA , 1997 . D. Hochbaum (ed.). Approximation Algorithms for NP-Hard Problems. PWS Publishing, MA, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_6_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman & Co. , New York , 1979 . M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co., New York, 1979."},{"key":"e_1_3_2_1_7_1","first-page":"28","article-title":"Using q-grams in a dbms for approximate string processing","volume":"24","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. Ipeirotis , H. Jagadish , N. Koudas , S. Muthukrishnan , L. Pietarinen , and D. Srivastava . Using q-grams in a dbms for approximate string processing . Data Engineering Bulletin , 24 : 28 -- 37 , 2001 . L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, L. Pietarinen, and D. Srivastava. Using q-grams in a dbms for approximate string processing. Data Engineering Bulletin, 24:28--37, 2001.","journal-title":"Data Engineering Bulletin"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci00009a019"},{"key":"e_1_3_2_1_9_1","first-page":"169","volume-title":"Proc. AAAI'94 Workshop on Knowledge Discovery in Databases (KDD'94)","author":"Holder L.","year":"1994","unstructured":"L. Holder , D. Cook , and S. Djoko . Substructure discovery in the subdue system . In Proc. AAAI'94 Workshop on Knowledge Discovery in Databases (KDD'94) , pages 169 -- 180 , 1994 . L. Holder, D. Cook, and S. Djoko. Substructure discovery in the subdue system. In Proc. AAAI'94 Workshop on Knowledge Discovery in Databases (KDD'94), pages 169--180, 1994."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_39"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.1.27"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.682179"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_15_1","volume-title":"Morgan Kaufmann","author":"Nilsson N.","year":"1980","unstructured":"N. Nilsson . Principles of Artificial Intelligence . Morgan Kaufmann , Palo Alto, CA , 1980 . N. Nilsson. Principles of Artificial Intelligence. Morgan Kaufmann, Palo Alto, CA, 1980."},{"key":"e_1_3_2_1_16_1","unstructured":"National Library of Medicine. http:\/\/chem.sis.nlm.nih.gov\/chemidplus.  National Library of Medicine. http:\/\/chem.sis.nlm.nih.gov\/chemidplus."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.599932"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/45.6.631"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315535"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.2.141"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.298173"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci9800211"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:19Z","timestamp":1750262899000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":25,"alternative-id":["10.1145\/1066157.1066244","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066244","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}