{"id":"https://openalex.org/W4318147431","doi":"https://doi.org/10.1109/bigdata55660.2022.10020310","title":"An Approximation Method for Querying Similar Large Graphs","display_name":"An Approximation Method for Querying Similar Large Graphs","publication_year":2022,"publication_date":"2022-12-17","ids":{"openalex":"https://openalex.org/W4318147431","doi":"https://doi.org/10.1109/bigdata55660.2022.10020310"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata55660.2022.10020310","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/bigdata55660.2022.10020310","pdf_url":null,"source":{"id":"https://openalex.org/S4363607709","display_name":"2022 IEEE International Conference on Big Data (Big Data)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5010022619","display_name":"Zhou Huang","orcid":"https://orcid.org/0000-0002-1255-1913"},"institutions":[{"id":"https://openalex.org/I44675526","display_name":"Shanghai Ocean University","ror":"https://ror.org/04n40zv07","country_code":"CN","type":"education","lineage":["https://openalex.org/I44675526"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhou Huang","raw_affiliation_strings":["Shanghai Ocean University,Information College,Shanghai,China","Information College, Shanghai Ocean University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Ocean University,Information College,Shanghai,China","institution_ids":["https://openalex.org/I44675526"]},{"raw_affiliation_string":"Information College, Shanghai Ocean University, Shanghai, China","institution_ids":["https://openalex.org/I44675526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064086456","display_name":"Feng Zhou","orcid":"https://orcid.org/0000-0002-2906-8127"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feng Zhou","raw_affiliation_strings":["Donghua University,School of Computer Science and Technology,Shanghai,China","School of Computer Science and Technology, Donghua University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Donghua University,School of Computer Science and Technology,Shanghai,China","institution_ids":["https://openalex.org/I181326427"]},{"raw_affiliation_string":"School of Computer Science and Technology, Donghua University, Shanghai, China","institution_ids":["https://openalex.org/I181326427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5934","last_page":"5943"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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.992900013923645,"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/computer-science","display_name":"Computer science","score":0.6975012421607971},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5707909464836121},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5233815908432007},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.46032965183258057},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4370814263820648},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43655213713645935},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.37409019470214844},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2307441532611847}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6975012421607971},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5707909464836121},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5233815908432007},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.46032965183258057},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4370814263820648},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43655213713645935},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.37409019470214844},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2307441532611847}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata55660.2022.10020310","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/bigdata55660.2022.10020310","pdf_url":null,"source":{"id":"https://openalex.org/S4363607709","display_name":"2022 IEEE International Conference on Big Data (Big Data)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2008511084","https://openalex.org/W2039444222","https://openalex.org/W2096729078","https://openalex.org/W2099225351","https://openalex.org/W2102913801","https://openalex.org/W2110034858","https://openalex.org/W2158671923","https://openalex.org/W2740846521","https://openalex.org/W2956647878","https://openalex.org/W3139401600","https://openalex.org/W4233653912"],"related_works":["https://openalex.org/W2764268078","https://openalex.org/W1566820354","https://openalex.org/W1967416529","https://openalex.org/W2256054477","https://openalex.org/W799170909","https://openalex.org/W35535541","https://openalex.org/W4300593812","https://openalex.org/W1983080496","https://openalex.org/W247697463","https://openalex.org/W2075637037"],"abstract_inverted_index":{"Searching":[0],"similar":[1,86,141,179],"graphs":[2,40,87,91,110,134],"in":[3,21,37,75,177],"graph":[4,9,59,65,100,173,180],"databases":[5],"for":[6,84,92],"a":[7,48,80,93,99,130,138,148,162],"query":[8,94,144,172],"has":[10],"attracted":[11],"extensive":[12],"attention":[13],"recently.":[14],"However,":[15],"existing":[16],"works":[17],"face":[18],"many":[19],"challenges":[20],"the":[22,29,54,106,126,143,171,175,178],"context":[23],"of":[24,34,57,108,133,150],"big":[25],"data.":[26],"For":[27],"example,":[28],"time":[30,157],"and":[31,111,154,190],"space":[32,113],"complexity":[33],"completing":[35],"queries":[36],"multiple":[38,89],"large":[39,58,90],"is":[41,67,188],"too":[42],"high":[43,139],"to":[44,104,128,142,165],"be":[45],"done":[46],"on":[47,125],"single":[49],"machine.":[50],"This":[51],"undoubtedly":[52],"increases":[53],"hardware":[55],"cost":[56],"similarity":[60,66,152],"calculation.":[61],"Moreover,":[62],"calculating":[63],"accurate":[64],"an":[68,118],"NP-hard":[69],"problem.":[70],"To":[71],"solve":[72],"these":[73],"problems,":[74],"this":[76],"paper,":[77],"we":[78,97,116,160],"propose":[79,98,117],"novel":[81],"approximation":[82,119],"method":[83,120,164,187],"searching":[85],"among":[88],"graph.":[95],"Firstly,":[96],"database":[101],"tensor":[102],"(GDT)":[103],"unify":[105],"representation":[107],"various":[109],"reduce":[112],"complexity.":[114,158],"Secondly,":[115],"through":[121],"several":[122],"sampling":[123],"operations":[124],"GDT":[127],"obtain":[129],"limited":[131],"set":[132,181],"that":[135],"are":[136],"with":[137,174],"probability":[140],"graph,":[145],"which":[146],"avoids":[147],"lot":[149],"futile":[151],"calculations":[153],"significantly":[155],"reduces":[156],"Thirdly,":[159],"design":[161],"fast":[163],"more":[166],"precisely":[167],"estimate":[168],"similarities":[169],"between":[170],"ones":[176],"obtained.":[182],"The":[183],"results":[184],"showed":[185],"our":[186],"efficient":[189],"feasible.":[191]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}