{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:11:31Z","timestamp":1781086291030,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,22]],"date-time":"2013-06-22T00:00:00Z","timestamp":1371859200000},"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":[[2013,6,22]]},"DOI":"10.1145\/2463676.2465300","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"337-348","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":227,"title":["Turbo\n            <sub>iso<\/sub>"],"prefix":"10.1145","author":[{"given":"Wook-Shin","family":"Han","sequence":"first","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinsoo","family":"Lee","sequence":"additional","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeong-Hoon","family":"Lee","sequence":"additional","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"28","volume-title":"SPIRE","author":"Baeza-Yates R. A.","year":"2000","unstructured":"R. A. Baeza-Yates and G. Valiente . An image similarity measure based on graph matching . In SPIRE , pages 28 -- 38 , 2000 . R. A. Baeza-Yates and G. Valiente. An image similarity measure based on graph matching. In SPIRE, pages 28--38, 2000."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920901"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"e_1_3_2_1_8_1","volume-title":"An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB, 6(2)","author":"Lee J.","year":"2013","unstructured":"J. Lee , W.-S. Han , R. Kasperovics , and J.-H. Lee . An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB, 6(2) , 2013 , http:\/\/www-db.knu.ac.kr\/vldb13.pdf. J. Lee, W.-S. Han, R. Kasperovics, and J.-H. Lee. An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB, 6(2), 2013, http:\/\/www-db.knu.ac.kr\/vldb13.pdf."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021972001000477X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/157485.164556"},{"key":"e_1_3_2_1_11_1","unstructured":"M. E. Saeedy and P. Kalnis. Grami: Generalized frequent pattern mining in a single large graph.  M. E. Saeedy and P. Kalnis. Grami: Generalized frequent pattern mining in a single large graph."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114248"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368955"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_3_2_1_22_1","first-page":"938","volume-title":"VLDB","author":"Zhao P.","year":"2007","unstructured":"P. Zhao , J. X. Yu , and P. S. Yu . Graph indexing: Tree + delta &gt;= graph . In VLDB , pages 938 -- 949 , 2007 . P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delta &gt;= graph. In VLDB, pages 938--949, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","location":"New York New York USA","acronym":"SIGMOD\/PODS'13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465300","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463676.2465300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:05Z","timestamp":1750235945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463676.2465300"}},"subtitle":["towards ultrafast and robust subgraph isomorphism search in large graph databases"],"short-title":[],"issued":{"date-parts":[[2013,6,22]]},"references-count":22,"alternative-id":["10.1145\/2463676.2465300","10.1145\/2463676"],"URL":"https:\/\/doi.org\/10.1145\/2463676.2465300","relation":{},"subject":[],"published":{"date-parts":[[2013,6,22]]},"assertion":[{"value":"2013-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}