{"id":"https://openalex.org/W3080281801","doi":"https://doi.org/10.1145/3394486.3403257","title":"GHashing: Semantic Graph Hashing for Approximate Similarity Search in Graph Databases","display_name":"GHashing: Semantic Graph Hashing for Approximate Similarity Search in Graph Databases","publication_year":2020,"publication_date":"2020-08-20","ids":{"openalex":"https://openalex.org/W3080281801","doi":"https://doi.org/10.1145/3394486.3403257","mag":"3080281801"},"language":"en","primary_location":{"id":"doi:10.1145/3394486.3403257","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3394486.3403257","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403257","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403257","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062465561","display_name":"Zongyue Qin","orcid":null},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zongyue Qin","raw_affiliation_strings":["Peking University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021611426","display_name":"Yunsheng Bai","orcid":"https://orcid.org/0000-0003-1623-6184"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yunsheng Bai","raw_affiliation_strings":["University of California, Los Angeles, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025213473","display_name":"Yizhou Sun","orcid":"https://orcid.org/0000-0003-1812-6843"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yizhou Sun","raw_affiliation_strings":["University of California, Los Angeles, Los Angeles, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062465561"],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":1.7691,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.87365417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2062","last_page":"2072"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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":0.9998000264167786,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9987000226974487,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9876000285148621,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7842780351638794},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6358199715614319},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.521369993686676},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5033943057060242},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48927614092826843},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.44270142912864685},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.43780940771102905},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.4350310266017914},{"id":"https://openalex.org/keywords/semantic-similarity","display_name":"Semantic similarity","score":0.42479246854782104},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3789830505847931},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.32870447635650635}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7842780351638794},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6358199715614319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.521369993686676},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5033943057060242},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48927614092826843},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.44270142912864685},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.43780940771102905},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.4350310266017914},{"id":"https://openalex.org/C130318100","wikidata":"https://www.wikidata.org/wiki/Q2268914","display_name":"Semantic similarity","level":2,"score":0.42479246854782104},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3789830505847931},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.32870447635650635},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3394486.3403257","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3394486.3403257","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403257","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3394486.3403257","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3394486.3403257","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3394486.3403257","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7454856101","display_name":null,"funder_award_id":"NSF III-1705169, NSF CAREER Award 1741634, NSF #1937599","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7868173616","display_name":null,"funder_award_id":"HR00112090027","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310598","display_name":"Amazon Web Services","ror":"https://ror.org/04mv4n011"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3080281801.pdf","grobid_xml":"https://content.openalex.org/works/W3080281801.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W984076445","https://openalex.org/W2008620264","https://openalex.org/W2012459404","https://openalex.org/W2056899820","https://openalex.org/W2152618599","https://openalex.org/W2164041127","https://openalex.org/W2170607286","https://openalex.org/W2473115824","https://openalex.org/W2519887557","https://openalex.org/W2560674852","https://openalex.org/W2615384791","https://openalex.org/W2666247594","https://openalex.org/W2783757608","https://openalex.org/W2897440725","https://openalex.org/W2906943923","https://openalex.org/W2920852583","https://openalex.org/W2942259124","https://openalex.org/W2952254971","https://openalex.org/W2963213486","https://openalex.org/W2964544183"],"related_works":["https://openalex.org/W2135779989","https://openalex.org/W2144265691","https://openalex.org/W2754607325","https://openalex.org/W2080135560","https://openalex.org/W2975588143","https://openalex.org/W2010970209","https://openalex.org/W2752074276","https://openalex.org/W2120031510","https://openalex.org/W2125671345","https://openalex.org/W2158169729"],"abstract_inverted_index":{"Graph":[0,25],"similarity":[1],"search":[2,248],"aims":[3],"to":[4,10,79,81,86,134,151,174,183,191,210],"find":[5],"the":[6,40,45,58,93,164,168,176,184,192,229],"most":[7,177],"similar":[8],"graphs":[9,52],"a":[11,14,20,31,107,124,146,160,215,242],"query":[12,207],"in":[13,17,100,155,245],"graph":[15,109,153,199,247,252],"database":[16],"terms":[18],"of":[19,39,66,73,75,96],"given":[21],"proximity":[22],"measure,":[23],"say":[24],"Edit":[26],"Distance":[27],"(GED).":[28],"It":[29],"is":[30,149,223],"widely":[32],"studied":[33],"yet":[34],"still":[35],"challenging":[36],"problem.":[37],"Most":[38],"studies":[41],"are":[42,64,181],"based":[43,113],"on":[44,57,224,234],"pruning-verification":[46],"framework,":[47],"which":[48,180,237],"first":[49,122],"prunes":[50],"non-promising":[51],"and":[53,102,137,167],"then":[54],"conducts":[55],"verification":[56],"small":[59],"candidate":[60],"set.":[61],"Existing":[62],"methods":[63,212],"capable":[65],"managing":[67],"databases":[68],"with":[69,126],"thousands":[70,74],"or":[71],"tens":[72],"graphs,":[76],"but":[77],"fail":[78],"scale":[80],"even":[82],"larger":[83],"database,":[84],"due":[85],"their":[87],"exact":[88,185],"pruning":[89,173,194],"strategy.":[90],"Inspired":[91],"by":[92,197],"recent":[94],"success":[95],"deep-learning-based":[97],"semantic":[98,114],"hashing":[99,200],"image":[101],"document":[103],"retrieval,":[104],"we":[105,162],"propose":[106],"novel":[108],"neural":[110],"network":[111],"(GNN)":[112],"hashing,":[115],"i.e.":[116],"GHashing,":[117],"for":[118,187,250],"approximate":[119,193],"pruning.":[120],"We":[121],"train":[123],"GNN":[125],"ground-truth":[127],"GED":[128,142],"results":[129],"so":[130],"that":[131,140,220,232],"it":[132],"learns":[133],"generate":[135],"embeddings":[136,170],"hash":[138,147,165],"codes":[139,166],"preserve":[141],"between":[143],"graphs.":[144],"Then":[145],"index":[148],"built":[150],"enable":[152],"lookup":[154],"constant":[156],"time.":[157],"To":[158],"answer":[159],"query,":[161],"use":[163],"continuous":[169],"as":[171],"two-level":[172],"retrieve":[175],"promising":[178],"candidates,":[179],"sent":[182],"solver":[186],"final":[188],"verification.":[189],"Due":[190],"strategy":[195],"leveraged":[196],"our":[198,202,221],"technique,":[201],"approach":[203,222],"achieves":[204],"significantly":[205],"faster":[206,227],"time":[208],"compared":[209],"state-of-the-art":[211],"while":[213],"maintaining":[214],"high":[216],"recall.":[217],"Experiments":[218],"show":[219],"average":[225],"20x":[226],"than":[228],"only":[230],"baseline":[231],"works":[233],"million-scale":[235],"databases,":[236],"demonstrates":[238],"GHashing":[239],"successfully":[240],"provides":[241],"new":[243],"direction":[244],"addressing":[246],"problem":[249],"large-scale":[251],"databases.":[253]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-01T17:29:45.350535","created_date":"2025-10-10T00:00:00"}
