{"id":"https://openalex.org/W3173361933","doi":"https://doi.org/10.1145/3448016.3457265","title":"Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching","display_name":"Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3173361933","doi":"https://doi.org/10.1145/3448016.3457265","mag":"3173361933"},"language":"en","primary_location":{"id":"doi:10.1145/3448016.3457265","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3457265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100706960","display_name":"Hyunjoon Kim","orcid":"https://orcid.org/0000-0002-0207-1190"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyunjoon Kim","raw_affiliation_strings":["Seoul National University &amp; SAP Labs Korea, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University &amp; SAP Labs Korea, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000556684","display_name":"Yun-Young Choi","orcid":"https://orcid.org/0000-0002-2450-2561"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yunyoung Choi","raw_affiliation_strings":["Seoul National University, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039462502","display_name":"Kunsoo Park","orcid":"https://orcid.org/0000-0001-5225-0907"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kunsoo Park","raw_affiliation_strings":["Seoul National University, Seoul, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079659938","display_name":"Xuemin Lin","orcid":"https://orcid.org/0000-0003-2396-7225"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xuemin Lin","raw_affiliation_strings":["University of New South Wales, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071834503","display_name":"Seok-Hee Hong","orcid":"https://orcid.org/0000-0003-1698-3868"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Seok-Hee Hong","raw_affiliation_strings":["The University of Sydney, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Sydney, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035744252","display_name":"Wook-Shin Han","orcid":"https://orcid.org/0000-0001-9206-9563"},"institutions":[{"id":"https://openalex.org/I123900574","display_name":"Pohang University of Science and Technology","ror":"https://ror.org/04xysgw12","country_code":"KR","type":"education","lineage":["https://openalex.org/I123900574"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Wook-Shin Han","raw_affiliation_strings":["Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea","institution_ids":["https://openalex.org/I123900574"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5100706960"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":3.4958,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.94064222,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"925","last_page":"937"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8459609746932983},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.8131426572799683},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.6950219869613647},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.650038480758667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5663291215896606},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5581933856010437},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5144134163856506},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4460563659667969},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43411219120025635},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3881966769695282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36228105425834656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.343192994594574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.19895103573799133},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.15499937534332275},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13407734036445618},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.08768579363822937},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.06378144025802612}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8459609746932983},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8131426572799683},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.6950219869613647},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.650038480758667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5663291215896606},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5581933856010437},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5144134163856506},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4460563659667969},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43411219120025635},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3881966769695282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36228105425834656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.343192994594574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.19895103573799133},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.15499937534332275},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13407734036445618},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.08768579363822937},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06378144025802612},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3448016.3457265","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3457265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:s-space.snu.ac.kr:10371/183778","is_oa":false,"landing_page_url":"https://hdl.handle.net/10371/183778","pdf_url":null,"source":{"id":"https://openalex.org/S4306401345","display_name":"Seoul National University Open Repository (Seoul National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139264467","host_organization_name":"Seoul National University","host_organization_lineage":["https://openalex.org/I139264467"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1498814251","https://openalex.org/W1946039914","https://openalex.org/W2008857988","https://openalex.org/W2011039300","https://openalex.org/W2012066443","https://openalex.org/W2013497015","https://openalex.org/W2035173902","https://openalex.org/W2051729070","https://openalex.org/W2071333487","https://openalex.org/W2100586946","https://openalex.org/W2110034858","https://openalex.org/W2112523291","https://openalex.org/W2112776329","https://openalex.org/W2126359798","https://openalex.org/W2132285256","https://openalex.org/W2140840007","https://openalex.org/W2141629057","https://openalex.org/W2143363350","https://openalex.org/W2147405597","https://openalex.org/W2155070669","https://openalex.org/W2163184742","https://openalex.org/W2232813226","https://openalex.org/W2241555812","https://openalex.org/W2254833717","https://openalex.org/W2293542641","https://openalex.org/W2423652555","https://openalex.org/W2464477051","https://openalex.org/W2505369411","https://openalex.org/W2536678141","https://openalex.org/W2564682724","https://openalex.org/W2608355501","https://openalex.org/W2755088640","https://openalex.org/W2772594351","https://openalex.org/W2784053634","https://openalex.org/W2795050613","https://openalex.org/W2798660790","https://openalex.org/W2809235938","https://openalex.org/W2909271600","https://openalex.org/W2948359422","https://openalex.org/W2949456109","https://openalex.org/W2950424810","https://openalex.org/W2970204999","https://openalex.org/W3025380722","https://openalex.org/W3029446523","https://openalex.org/W4244579861"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W1512756268","https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W2566098902","https://openalex.org/W3173361933","https://openalex.org/W1887488684","https://openalex.org/W4281613391"],"abstract_inverted_index":{"Subgraph":[0],"query":[1,78,149],"processing":[2,150],"(also":[3],"known":[4],"as":[5],"subgraph":[6,9,58,115,124,133,136],"search)":[7],"and":[8,42,90,106,135],"matching":[10,85,137],"are":[11],"fundamental":[12],"graph":[13,79],"problems":[14],"in":[15,44,65,76,97,109],"many":[16,49],"application":[17],"domains.":[18],"A":[19],"lot":[20],"of":[21,63,74,87,94,144],"efforts":[22],"have":[23],"been":[24],"made":[25],"to":[26,67,82,104,119,141,148],"develop":[27],"practical":[28],"solutions":[29],"for":[30,114,123],"these":[31],"problems.":[32],"Despite":[33],"the":[34,88],"efforts,":[35],"existing":[36],"algorithms":[37,138],"showed":[38],"limited":[39],"running":[40],"time":[41],"scalability":[43],"dealing":[45],"with":[46,146],"large":[47],"and/or":[48],"graphs.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"propose":[55],"a":[56,77,98],"new":[57],"search":[59,69,110,116,134],"algorithm":[60,122],"using":[61],"equivalences":[62],"vertices":[64,75,96],"order":[66,86],"reduce":[68],"space:":[70],"(1)":[71],"static":[72],"equivalence":[73,93],"that":[80,128],"leads":[81],"an":[83,120],"efficient":[84],"vertices,":[89],"(2)":[91],"dynamic":[92],"candidate":[95],"data":[99],"graph,":[100],"which":[101],"enables":[102],"us":[103],"capture":[105],"remove":[107],"redundancies":[108],"space.":[111],"These":[112],"techniques":[113],"also":[117],"lead":[118],"improved":[121],"matching.":[125],"Experiments":[126],"show":[127],"our":[129],"approach":[130],"outperforms":[131],"state-of-the-art":[132],"by":[139],"up":[140],"several":[142],"orders":[143],"magnitude":[145],"respect":[147],"time.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":22},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
