{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:06Z","timestamp":1750221126829,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,13]]},"DOI":"10.1145\/3308558.3313448","type":"proceedings-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:17:59Z","timestamp":1557749879000},"page":"1886-1896","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["RAQ: Relationship-Aware Graph Querying in Large Networks"],"prefix":"10.1145","author":[{"given":"Jithin","family":"Vachery","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Madras, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akhil","family":"Arora","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Core rankings portal. http:\/\/portal.core.edu.au\/conf-ranks\/.  Core rankings portal. http:\/\/portal.core.edu.au\/conf-ranks\/."},{"key":"e_1_3_2_1_2_1","unstructured":"DBLP\n  : Computer Science Bibliography. http:\/\/dblp.uni-trier.de\/.  DBLP: Computer Science Bibliography. http:\/\/dblp.uni-trier.de\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Facebook Graph Search. https:\/\/en.wikipedia.org\/wiki\/Facebook_Graph_Search.  Facebook Graph Search. https:\/\/en.wikipedia.org\/wiki\/Facebook_Graph_Search."},{"key":"e_1_3_2_1_4_1","unstructured":"Google Knowledge Graph. https:\/\/www.google.com\/intl\/es419\/insidesearch\/features\/search\/knowledge.html.  Google Knowledge Graph. https:\/\/www.google.com\/intl\/es419\/insidesearch\/features\/search\/knowledge.html."},{"key":"e_1_3_2_1_5_1","unstructured":"IMDB\n  : The Internet Movie Data Base. https:\/\/www.imdb.com\/interfaces\/.  IMDB: The Internet Movie Data Base. https:\/\/www.imdb.com\/interfaces\/."},{"key":"e_1_3_2_1_6_1","unstructured":"SNAP Datasets. https:\/\/snap.stanford.edu\/data\/.  SNAP Datasets. https:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588574"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785162.1785216"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2717109"},{"key":"e_1_3_2_1_10_1","first-page":"696","volume-title":"IJCAI","author":"Biba M.","year":"2007","unstructured":"M. Biba , F. Esposito , S. Ferilli , N. Di Mauro , and T. M. A. Basile . Unsupervised discretization using kernel density estimation . In IJCAI , pages 696 - 701 , 2007 . M. Biba, F. Esposito, S. Ferilli, N. Di Mauro, and T. M. A. Basile. Unsupervised discretization using kernel density estimation. In IJCAI, pages 696-701, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"e_1_3_2_1_12_1","volume-title":"A graph distance metric based on the maximal common subgraph. Pattern recognition letters, 19(3):255-259","author":"Bunke H.","year":"1998","unstructured":"H. Bunke and K. Shearer . A graph distance metric based on the maximal common subgraph. Pattern recognition letters, 19(3):255-259 , 1998 . H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern recognition letters, 19(3):255-259, 1998."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187908"},{"key":"e_1_3_2_1_14_1","first-page":"1281","volume-title":"WWW","author":"Dutta S.","year":"2017","unstructured":"S. Dutta , P. Nayek , and A. Bhattacharya . Neighbor-aware search for approximate labeled graph matching using the chi-square statistics . In WWW , pages 1281 - 1290 , 2017 . S. Dutta, P. Nayek, and A. Bhattacharya. Neighbor-aware search for approximate labeled graph matching using the chi-square statistics. In WWW, pages 1281-1290, 2017."},{"key":"e_1_3_2_1_15_1","first-page":"162","volume-title":"SDM","author":"Faloutsos C.","year":"2013","unstructured":"C. Faloutsos , D. Koutra , and J. T. Vogelstein . DELTACON: A principled massive-graph similarity function . In SDM , pages 162 - 170 , 2013 . C. Faloutsos, D. Koutra, and J. T. Vogelstein. DELTACON: A principled massive-graph similarity function. In SDM, pages 162-170, 2013."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00017-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_18_1","volume-title":"ICDE","author":"He H.","year":"2006","unstructured":"H. He and A. K. Singh . Closure-tree: An index structure for graph queries . In ICDE , 2006 . H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In ICDE, 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2426696"},{"key":"e_1_3_2_1_20_1","volume-title":"Sage","author":"Kanji G. K.","year":"2006","unstructured":"G. K. Kanji . 100 Statistical Tests . Sage , 2006 . G. K. Kanji. 100 Statistical Tests. Sage, 2006."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"e_1_3_2_1_23_1","unstructured":"S. Kotsiantis and D. Kanellopoulos. Discretization techniques: A recent survey.  S. Kotsiantis and D. Kanellopoulos. Discretization techniques: A recent survey."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00078"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732273"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0429-2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0048"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1129-y"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298483.3298589"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspl.1895.0041"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/minf.201100058"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610524"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.133"},{"key":"e_1_3_2_1_34_1","volume-title":"Mining statistically significant molecular substructures for efficient molecular classification. Journal of chemical information and modeling, 49(11):2537-2550","author":"Ranu S.","year":"2009","unstructured":"S. Ranu and A. K. Singh . Mining statistically significant molecular substructures for efficient molecular classification. Journal of chemical information and modeling, 49(11):2537-2550 , 2009 . S. Ranu and A. K. Singh. Mining statistically significant molecular substructures for efficient molecular classification. Journal of chemical information and modeling, 49(11):2537-2550, 2009."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247666"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4578-0"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336677"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_1_39_1","volume-title":"The American journal of psychology, 15(1):72-101","author":"Spearman C.","year":"1904","unstructured":"C. Spearman . The proof and measurement of association between two things. The American journal of psychology, 15(1):72-101 , 1904 . C. Spearman. The proof and measurement of association between two things. The American journal of psychology, 15(1):72-101, 1904."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1055"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484114"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505723"},{"key":"e_1_3_2_1_49_1","first-page":"90","volume-title":"ICAPS","author":"Zhou R.","year":"2005","unstructured":"R. Zhou and E. A. Hansen . Beam-stack search: Integrating backtracking with beam search . In ICAPS , pages 90 - 98 , 2005 . R. Zhou and E. A. Hansen. Beam-stack search: Integrating backtracking with beam search. In ICAPS, pages 90-98, 2005."}],"event":{"name":"WWW '19: The Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee"],"location":"San Francisco CA USA","acronym":"WWW '19"},"container-title":["The World Wide Web Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313448","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308558.3313448","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:17Z","timestamp":1750208537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308558.3313448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":49,"alternative-id":["10.1145\/3308558.3313448","10.1145\/3308558"],"URL":"https:\/\/doi.org\/10.1145\/3308558.3313448","relation":{},"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"2019-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}