{"id":"https://openalex.org/W4380551964","doi":"https://doi.org/10.1145/3589312","title":"GuP: Fast Subgraph Matching by Guard-based Pruning","display_name":"GuP: Fast Subgraph Matching by Guard-based Pruning","publication_year":2023,"publication_date":"2023-06-13","ids":{"openalex":"https://openalex.org/W4380551964","doi":"https://doi.org/10.1145/3589312"},"language":"en","primary_location":{"id":"doi:10.1145/3589312","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3589312","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2306.06557","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101609545","display_name":"Junya Arai","orcid":"https://orcid.org/0000-0002-5681-5941"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Junya Arai","raw_affiliation_strings":["Nippon Telegraph and Telephone Corporation, Musashino-shi, Japan"],"raw_orcid":"https://orcid.org/0000-0002-5681-5941","affiliations":[{"raw_affiliation_string":"Nippon Telegraph and Telephone Corporation, Musashino-shi, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101917967","display_name":"Yasuhiro Fujiwara","orcid":"https://orcid.org/0000-0001-9578-1118"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasuhiro Fujiwara","raw_affiliation_strings":["Nippon Telegraph and Telephone Corporation, Atsugi-shi, Japan"],"raw_orcid":"https://orcid.org/0000-0001-9578-1118","affiliations":[{"raw_affiliation_string":"Nippon Telegraph and Telephone Corporation, Atsugi-shi, Japan","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030272842","display_name":"Makoto Onizuka","orcid":"https://orcid.org/0000-0001-5559-8300"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Makoto Onizuka","raw_affiliation_strings":["Osaka University, Suita-shi, Japan"],"raw_orcid":"https://orcid.org/0000-0001-5559-8300","affiliations":[{"raw_affiliation_string":"Osaka University, Suita-shi, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1481,"has_fulltext":true,"cited_by_count":39,"citation_normalized_percentile":{"value":0.95561059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"1","issue":"2","first_page":"1","last_page":"26"},"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.9979000091552734,"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.9962999820709229,"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/degeneracy","display_name":"Degeneracy (biology)","score":0.636931300163269},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5669136643409729},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5630309581756592},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5572773814201355},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.544590175151825},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.540457546710968},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.5386789441108704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5310754179954529},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.48941484093666077},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48495224118232727},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4551442265510559},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4440969228744507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4010828733444214},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3872881233692169},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3591307997703552},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15541905164718628},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.07537171244621277}],"concepts":[{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.636931300163269},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5669136643409729},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5630309581756592},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5572773814201355},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.544590175151825},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.540457546710968},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.5386789441108704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5310754179954529},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.48941484093666077},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48495224118232727},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4551442265510559},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4440969228744507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4010828733444214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3872881233692169},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3591307997703552},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15541905164718628},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.07537171244621277},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3589312","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3589312","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2306.06557","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.06557","pdf_url":"https://arxiv.org/pdf/2306.06557","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2306.06557","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2306.06557","pdf_url":"https://arxiv.org/pdf/2306.06557","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7527526486","display_name":"Research and development on workload-aware graph database engine","funder_award_id":"20H00583","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380551964.pdf","grobid_xml":"https://content.openalex.org/works/W4380551964.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1217907795","https://openalex.org/W1802782715","https://openalex.org/W1975068437","https://openalex.org/W2035173902","https://openalex.org/W2036380454","https://openalex.org/W2038118137","https://openalex.org/W2051729070","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2143363350","https://openalex.org/W2147405597","https://openalex.org/W2163184742","https://openalex.org/W2241555812","https://openalex.org/W2293919922","https://openalex.org/W2423652555","https://openalex.org/W2492955493","https://openalex.org/W2531563875","https://openalex.org/W2577167493","https://openalex.org/W2753693129","https://openalex.org/W2889320527","https://openalex.org/W2948359422","https://openalex.org/W2970204999","https://openalex.org/W2994326685","https://openalex.org/W3012207181","https://openalex.org/W3025380722","https://openalex.org/W3029446523","https://openalex.org/W3109773888","https://openalex.org/W3137504194","https://openalex.org/W3137705542","https://openalex.org/W4232666159","https://openalex.org/W4244579861","https://openalex.org/W4281613391","https://openalex.org/W4286447321","https://openalex.org/W4302070056","https://openalex.org/W6723075474"],"related_works":["https://openalex.org/W2953496651","https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W1512756268","https://openalex.org/W3208942821","https://openalex.org/W4300773579","https://openalex.org/W167435155","https://openalex.org/W1887488684","https://openalex.org/W4285101991","https://openalex.org/W2035609387"],"abstract_inverted_index":{"Subgraph":[0],"matching,":[1],"which":[2],"finds":[3],"subgraphs":[4],"isomorphic":[5,42,85],"to":[6,84,91],"a":[7,18,63,75,89,133],"query,":[8],"is":[9,47],"crucial":[10],"for":[11],"information":[12],"retrieval":[13],"from":[14],"data":[15],"represented":[16],"as":[17],"graph.":[19],"To":[20],"avoid":[21],"redundant":[22],"explorations":[23],"in":[24],"the":[25,30,105,119],"data,":[26],"existing":[27],"methods":[28,129],"restrict":[29],"search":[31,79,106,120],"space":[32,121],"by":[33],"extracting":[34],"candidate":[35,51,93],"vertices":[36,52],"and":[37,95,122],"edges":[38],"that":[39,81,115,127],"may":[40],"constitute":[41],"subgraphs.":[43,56,86],"However,":[44],"expensive":[45],"computation":[46],"still":[48],"required":[49],"because":[50],"induce":[53],"many":[54],"non-isomorphic":[55],"In":[57],"this":[58],"paper,":[59],"we":[60],"propose":[61],"GuP,":[62],"subgraph":[64],"matching":[65],"algorithm":[66],"with":[67],"pruning":[68],"based":[69],"on":[70,104],"guards.":[71],"A":[72],"guard":[73,90],"represents":[74],"pattern":[76],"of":[77],"intermediate":[78],"states":[80],"never":[82],"lead":[83],"By":[87],"attaching":[88],"each":[92,109],"vertex":[94],"edge,":[96],"GuP":[97,116],"adaptively":[98],"filters":[99],"out":[100],"unnecessary":[101],"candidates":[102],"depending":[103],"state":[107],"at":[108],"step.":[110],"The":[111],"experimental":[112],"results":[113],"show":[114],"effectively":[117],"reduces":[118],"can":[123],"answer":[124,131],"difficult":[125],"queries":[126],"state-of-the-art":[128],"cannot":[130],"within":[132],"practical":[134],"time":[135],"frame.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":22},{"year":2024,"cited_by_count":11}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}