{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:22Z","timestamp":1750307302761,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"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":[[2011,6,12]]},"DOI":"10.1145\/1989323.1989464","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"1241-1242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["iGraph in action"],"prefix":"10.1145","author":[{"given":"Wook-Shin","family":"Han","sequence":"first","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}]},{"given":"Minh-Duc","family":"Pham","sequence":"additional","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}]},{"given":"Jinsoo","family":"Lee","sequence":"additional","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}]},{"given":"Romans","family":"Kasperovics","sequence":"additional","affiliation":[{"name":"Kyungpook National University, Daegu, South Korea"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Aids antiviral dataset used for gindex. http:\/\/www.xifengyan.net\/software.htm.  Aids antiviral dataset used for gindex. http:\/\/www.xifengyan.net\/software.htm."},{"key":"e_1_3_2_1_2_1","unstructured":"Java universal network\/graph framework. http:\/\/jung.sourceforge.net.  Java universal network\/graph framework. http:\/\/jung.sourceforge.net."},{"key":"e_1_3_2_1_3_1","unstructured":"Jchempaint. http:\/\/http:\/\/sourceforge.net\/projects\/cdk.  Jchempaint. http:\/\/http:\/\/sourceforge.net\/projects\/cdk."},{"key":"e_1_3_2_1_4_1","unstructured":"The pubchem project. pubchem.ncbi.nlm.nih.gov.  The pubchem project. pubchem.ncbi.nlm.nih.gov."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_1_6_1","volume-title":"igraph: A framework for comparisons of disk-based graph indexing techniques. PVLDB, 3(1)","author":"Han W.-S.","year":"2010","unstructured":"W.-S. Han , J. Lee , M.-D. Pham , and J. X. Yu . igraph: A framework for comparisons of disk-based graph indexing techniques. PVLDB, 3(1) , 2010 . W.-S. Han, J. Lee, M.-D. Pham, and J. X. Yu. igraph: A framework for comparisons of disk-based graph indexing techniques. PVLDB, 3(1), 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.37"},{"key":"e_1_3_2_1_8_1","volume-title":"Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 1(1)","author":"Shang H.","year":"2008","unstructured":"H. Shang , Y. Zhang , X. Lin , and J. X. Yu . Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 1(1) , 2008 . H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 1(1), 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_10_1","volume-title":"VLDB","author":"Zhao P.","year":"2007","unstructured":"P. Zhao , J. X. Yu , and P. S. Yu . Graph indexing: Tree + delta >= graph . In VLDB , 2007 . P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delta >= graph. In VLDB, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Athens Greece","acronym":"SIGMOD\/PODS '11"},"container-title":["Proceedings of the 2011 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989464","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989323.1989464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:56Z","timestamp":1750244396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989464"}},"subtitle":["performance analysis of disk-based graph indexing techniques"],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":11,"alternative-id":["10.1145\/1989323.1989464","10.1145\/1989323"],"URL":"https:\/\/doi.org\/10.1145\/1989323.1989464","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}