{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:07Z","timestamp":1750307167373,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,2,20]],"date-time":"2012-02-20T00:00:00Z","timestamp":1329696000000},"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":[[2012,2,20]]},"DOI":"10.1145\/2184751.2184820","type":"proceedings-article","created":{"date-parts":[[2012,4,17]],"date-time":"2012-04-17T12:53:22Z","timestamp":1334667202000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["EGDIM"],"prefix":"10.1145","author":[{"given":"Shariful","family":"Islam","sequence":"first","affiliation":[{"name":"University of Dhaka, Bangladesh"}]},{"given":"Anna","family":"Fariha","sequence":"additional","affiliation":[{"name":"University of Dhaka, Bangladesh"}]},{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"additional","affiliation":[{"name":"University of Dhaka, Bangladesh"}]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[{"name":"Kyung Hee University"}]}],"member":"320","published-online":{"date-parts":[[2012,2,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Data mining. Website. http:\/\/en.wikipedia.org\/wiki\/Data_mining.  Data mining. Website. http:\/\/en.wikipedia.org\/wiki\/Data_mining."},{"key":"e_1_3_2_1_2_1","volume-title":"Maebashi","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gSpan: Graph-based substructure pattern mining. pages 721--724 , Maebashi , Japan , 2002 . 2002 Int. Conf. on Data Mining (ICDM\u016002). X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. pages 721--724, Maebashi, Japan, 2002. 2002 Int. Conf. on Data Mining (ICDM\u016002)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114248"},{"key":"e_1_3_2_1_5_1","volume-title":"Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach","author":"Han Jiawei","year":"2004","unstructured":"Jiawei Han , Jian Pei , Yiwen Yin , and Runying Mao . Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach . Kluwer Academic Publishers , 2004 . Jiawei Han, Jian Pei, Yiwen Yin, and Runying Mao. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Kluwer Academic Publishers, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844749"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367629"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844706"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1921702"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508857.1508859"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963299"},{"key":"e_1_3_2_1_13_1","volume-title":"Efficient algorithms for supergraph query processing on graph databases. page 2","author":"Zhang S.","year":"2009","unstructured":"S. Zhang , X. Gao , W. Wu , J. Li , and H. Gao . Efficient algorithms for supergraph query processing on graph databases. page 2 . Springer Science , 2009 . S. Zhang, X. Gao, W. Wu, J. Li, and H. Gao. Efficient algorithms for supergraph query processing on graph databases. page 2. Springer Science, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_1_15_1","volume-title":"Roma","author":"Cooper B.","year":"2001","unstructured":"B. Cooper , N. Sample , M. Franklin , G. Hjaltason , M., and Shadmon. A fast index for semistructured data . Roma , Italy , 2001 . 2001 Int. Conf. on Very Large Data Bases (VLDB\u016001). B. Cooper, N. Sample, M. Franklin, G. Hjaltason, M., and Shadmon. A fast index for semistructured data. Roma, Italy, 2001. 2001 Int. Conf. on Very Large Data Bases (VLDB\u016001)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1887854.1887873"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543620"},{"key":"e_1_3_2_1_18_1","volume-title":"Data Mining Concepts and Techniques. Morgan Kaufmann","author":"Han J.","year":"2006","unstructured":"J. Han and M. Kamber . Data Mining Concepts and Techniques. Morgan Kaufmann , second edition, 2006 . J. Han and M. Kamber. Data Mining Concepts and Techniques. Morgan Kaufmann, second edition, 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516241.1516357"},{"key":"e_1_3_2_1_20_1","unstructured":"Graph isomorphism. Website. http:\/\/en.wikipedia.org\/wiki\/Graph_isomorphism.  Graph isomorphism. Website. http:\/\/en.wikipedia.org\/wiki\/Graph_isomorphism."},{"key":"e_1_3_2_1_21_1","unstructured":"Subgraph isomorphism problem. Website. http:\/\/en.wikipedia.org\/wiki\/Subgraph_isomorphism_problem.  Subgraph isomorphism problem. Website. http:\/\/en.wikipedia.org\/wiki\/Subgraph_isomorphism_problem."},{"key":"e_1_3_2_1_22_1","unstructured":"Xifeng yan. Website. http:\/\/www.cs.ucsb.edu\/~xyan\/.  Xifeng yan. Website. http:\/\/www.cs.ucsb.edu\/~xyan\/."}],"event":{"name":"ICUIMC '12: The 6th International Conference on Ubiquitous Information Management and Communication","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","SKKU SUNGKYUNKWAN UNIVERSITY"],"location":"Kuala Lumpur Malaysia","acronym":"ICUIMC '12"},"container-title":["Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2184751.2184820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2184751.2184820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:40Z","timestamp":1750240480000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2184751.2184820"}},"subtitle":["evolving graph database indexing method"],"short-title":[],"issued":{"date-parts":[[2012,2,20]]},"references-count":22,"alternative-id":["10.1145\/2184751.2184820","10.1145\/2184751"],"URL":"https:\/\/doi.org\/10.1145\/2184751.2184820","relation":{},"subject":[],"published":{"date-parts":[[2012,2,20]]},"assertion":[{"value":"2012-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}