{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:23Z","timestamp":1750220543299,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education Singapore","award":["MOE2015-T2-1-040"],"award-info":[{"award-number":["MOE2015-T2-1-040"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457251","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"764-776","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces"],"prefix":"10.1145","author":[{"given":"Kai","family":"Huang","sequence":"first","affiliation":[{"name":"Fudan University & Nanyang Technological University, Shanghai, China"}]},{"given":"Huey Eng","family":"Chua","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Sourav S.","family":"Bhowmick","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"textscaids dataset. https:\/\/wiki.nci.nih.gov\/display\/NCIDTPdata\/AIDS  textscaids dataset. https:\/\/wiki.nci.nih.gov\/display\/NCIDTPdata\/AIDS"},{"key":"e_1_3_2_2_2_1","unstructured":"Antiviral  Antiviral"},{"key":"e_1_3_2_2_3_1","unstructured":"Screen  Screen"},{"key":"e_1_3_2_2_4_1","unstructured":"Data.  Data."},{"key":"e_1_3_2_2_5_1","unstructured":"rugBank interface. https:\/\/go.drugbank.com\/structures\/search\/small_molecule_drugs\/structure.  rugBank interface. https:\/\/go.drugbank.com\/structures\/search\/small_molecule_drugs\/structure."},{"key":"e_1_3_2_2_6_1","unstructured":"Molecules dataset. https:\/\/www.emolecules.com\/info\/plus\/download-database.  Molecules dataset. https:\/\/www.emolecules.com\/info\/plus\/download-database."},{"key":"e_1_3_2_2_7_1","unstructured":"ubChem dataset. ftp:\/\/ftp.ncbi.nlm.nih.gov\/pubchem\/Compound\/CURRENT-Full\/SDF\/.  ubChem dataset. ftp:\/\/ftp.ncbi.nlm.nih.gov\/pubchem\/Compound\/CURRENT-Full\/SDF\/."},{"key":"e_1_3_2_2_8_1","unstructured":"ubChem interface. https:\/\/pubchem.ncbi.nlm.nih.gov\/\/edit3\/index.html.  ubChem interface. https:\/\/pubchem.ncbi.nlm.nih.gov\/\/edit3\/index.html."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2743075"},{"key":"e_1_3_2_2_10_1","volume-title":"The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1)","author":"Arora E.","year":"2012","unstructured":". Arora , E. Hazan , S. Kale . The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1) , 2012 . . Arora, E. Hazan, S. Kale. The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 2012."},{"key":"e_1_3_2_2_11_1","unstructured":". Arthur S. Vassilvitskii. K-means  . Arthur S. Vassilvitskii. K-means"},{"volume-title":"The advantages of careful seeding","year":"2007","key":"e_1_3_2_2_12_1","unstructured":": The advantages of careful seeding . In SIAM , 2007 . : The advantages of careful seeding. In SIAM, 2007."},{"key":"e_1_3_2_2_13_1","volume-title":"Mining frequent closed rooted trees. Machine Learning, 78(1--2):1","author":"Balc\u00e1zar A.","year":"2010","unstructured":".L. Balc\u00e1zar , A. Bifet , A. Lozano . Mining frequent closed rooted trees. Machine Learning, 78(1--2):1 , 2010 . .L. Balc\u00e1zar, A. Bifet, A. Lozano. Mining frequent closed rooted trees. Machine Learning, 78(1--2):1, 2010."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401900"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1937721.1937724"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994517"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384681"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16001-1_17"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_2_20_1","volume-title":"IDEAS","author":"Cheung O.R.","year":"2003","unstructured":". Cheung , O.R. Zaiane . Incremental mining of frequent patterns without candidate generation or support constraint . In IDEAS , 2003 . . Cheung, O.R. Zaiane. Incremental mining of frequent patterns without candidate generation or support constraint. In IDEAS, 2003."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989420"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035944"},{"key":"e_1_3_2_2_25_1","volume-title":"Instruments, & Computers, 35(3)","author":"Faulkner","year":"2003","unstructured":".L. Faulkner . Beyond the five-user assumption: Benefits of increased sample sizes in usability testing. Behavior Research Methods , Instruments, & Computers, 35(3) , 2003 . .L. Faulkner. Beyond the five-user assumption: Benefits of increased sample sizes in usability testing. Behavior Research Methods, Instruments, & Computers, 35(3), 2003."},{"key":"e_1_3_2_2_26_1","volume-title":"ICDE","author":"He A.K.","year":"2006","unstructured":". He , A.K. Singh . Closure-tree : An index structure for graph queries . In ICDE , 2006 . . He, A.K. Singh. Closure-tree: An index structure for graph queries. In ICDE, 2006."},{"key":"e_1_3_2_2_27_1","volume-title":"SIGMOD","author":"Huang H.E.","year":"2019","unstructured":". Huang , H.E. Chua , S.S. Bhowmick , B. Choi , S. Zhou . CATAPULT : data-driven selection of canned patterns for efficient visual graph query formulation . In SIGMOD , 2019 . . Huang, H.E. Chua, S.S. Bhowmick, B. Choi, S. Zhou. CATAPULT: data-driven selection of canned patterns for efficient visual graph query formulation. In SIGMOD, 2019."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1057\/ivs.2009.10"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1841406"},{"key":"e_1_3_2_2_31_1","volume-title":"MLG","author":"Li M.","year":"2011","unstructured":". Li , M. Semerci , B. Yener , M.J. Zaki . Graph classification via topological and label attributes . In MLG , 2011 . . Li, M. Semerci, B. Yener, M.J. Zaki. Graph classification via topological and label attributes. In MLG, 2011."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1816039116"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-009-0460-7"},{"key":"e_1_3_2_2_34_1","unstructured":". Morina. The trie data structure in Java. Available at https:\/\/www.baeldung.com\/trie-java. Accessed on 30 September 2019.  . Morina. The trie data structure in Java. Available at https:\/\/www.baeldung.com\/trie-java. Accessed on 30 September 2019."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1769371.1769373"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781794.1781813"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807264"},{"key":"e_1_3_2_2_40_1","volume-title":"Desigining the user interface: strategies for effective human-computer interaction","author":"Shneiderman C.","year":"2010","unstructured":". Shneiderman , C. Plaisant . Desigining the user interface: strategies for effective human-computer interaction . 5 th Ed., Addison-Wesley , 2010 . . Shneiderman, C. Plaisant. Desigining the user interface: strategies for effective human-computer interaction. 5th Ed., Addison-Wesley, 2010.","edition":"5"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/ited.2013.0124"},{"key":"e_1_3_2_2_42_1","volume-title":"ICDE","author":"Wang W.","year":"2006","unstructured":". Wang , W. Hsu , M.L. Lee , C. Sheng . A partition-based approach to graph mining . In ICDE , 2006 . . Wang, W. Hsu, M.L. Lee, C. Sheng. A partition-based approach to graph mining. In ICDE, 2006."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915216"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.visinf.2018.12.006"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.11"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746482"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113411"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368955"},{"key":"e_1_3_2_2_50_1","unstructured":". Zhao J.X. Yu P.S. Yu. Graph indexing: tree  . Zhao J.X. Yu P.S. Yu. Graph indexing: tree"},{"volume-title":"VLDB","year":"2007","key":"e_1_3_2_2_51_1","unstructured":"delta= graph. In VLDB , 2007 . delta= graph. In VLDB, 2007."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353369"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Virtual Event China","acronym":"SIGMOD\/PODS '21"},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:06Z","timestamp":1750195686000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":51,"alternative-id":["10.1145\/3448016.3457251","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457251","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}