{"id":"https://openalex.org/W4281968090","doi":"https://doi.org/10.1145/3514221.3517862","title":"A Hierarchical Contraction Scheme for Querying Big Graphs","display_name":"A Hierarchical Contraction Scheme for Querying Big Graphs","publication_year":2022,"publication_date":"2022-06-10","ids":{"openalex":"https://openalex.org/W4281968090","doi":"https://doi.org/10.1145/3514221.3517862"},"language":"en","primary_location":{"id":"doi:10.1145/3514221.3517862","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3514221.3517862","pdf_url":null,"source":{"id":"https://openalex.org/S4363608845","display_name":"Proceedings of the 2022 International Conference on Management of 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":"Proceedings of the 2022 International Conference on Management of 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/A5070565287","display_name":"Wenfei Fan","orcid":"https://orcid.org/0000-0001-5149-2656"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Wenfei Fan","raw_affiliation_strings":["University of Edinburgh, Shenzhen Institute of Computing Sciences, & Beihang University, Edinburgh, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Shenzhen Institute of Computing Sciences, & Beihang University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100631362","display_name":"Yuanhao Li","orcid":"https://orcid.org/0000-0002-6938-5012"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Yuanhao Li","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101441449","display_name":"Muyang Liu","orcid":"https://orcid.org/0000-0002-4972-7329"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Muyang Liu","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008951824","display_name":"Can Lu","orcid":"https://orcid.org/0000-0002-7334-2875"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Can Lu","raw_affiliation_strings":["Shenzhen Institute of Computing Sciences, Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shenzhen Institute of Computing Sciences, Shenzhen, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1726","last_page":"1740"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7757858037948608},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5988225340843201},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.589266300201416},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5680536031723022},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.528007984161377},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5170660614967346},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4416287839412689},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.4203130602836609},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.4112221598625183},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3241756558418274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15776321291923523}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7757858037948608},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5988225340843201},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.589266300201416},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5680536031723022},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.528007984161377},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5170660614967346},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4416287839412689},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4203130602836609},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.4112221598625183},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3241756558418274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15776321291923523},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3514221.3517862","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3514221.3517862","pdf_url":null,"source":{"id":"https://openalex.org/S4363608845","display_name":"Proceedings of the 2022 International Conference on Management of 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":"Proceedings of the 2022 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3231785745","display_name":null,"funder_award_id":"62002236","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8721884101","display_name":null,"funder_award_id":"652976","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W217817341","https://openalex.org/W1475732121","https://openalex.org/W1501254937","https://openalex.org/W1525887080","https://openalex.org/W1550080987","https://openalex.org/W1552847225","https://openalex.org/W1566772816","https://openalex.org/W1942786204","https://openalex.org/W1994727615","https://openalex.org/W2011039300","https://openalex.org/W2011282943","https://openalex.org/W2011824721","https://openalex.org/W2029706450","https://openalex.org/W2049354208","https://openalex.org/W2051658231","https://openalex.org/W2059052871","https://openalex.org/W2073899708","https://openalex.org/W2086142729","https://openalex.org/W2096544401","https://openalex.org/W2111708605","https://openalex.org/W2116007667","https://openalex.org/W2122837498","https://openalex.org/W2125580539","https://openalex.org/W2131785201","https://openalex.org/W2138295324","https://openalex.org/W2143749277","https://openalex.org/W2145604831","https://openalex.org/W2147405597","https://openalex.org/W2166037832","https://openalex.org/W2374597300","https://openalex.org/W2433292369","https://openalex.org/W2440674561","https://openalex.org/W2493178615","https://openalex.org/W2574671299","https://openalex.org/W2612555525","https://openalex.org/W2771362234","https://openalex.org/W2783930193","https://openalex.org/W2799059383","https://openalex.org/W2803210444","https://openalex.org/W2946046356","https://openalex.org/W2950542868","https://openalex.org/W2962936633","https://openalex.org/W3001851942","https://openalex.org/W3032617209","https://openalex.org/W4210896998","https://openalex.org/W4213246264","https://openalex.org/W4232413872"],"related_works":["https://openalex.org/W1491170033","https://openalex.org/W2078123803","https://openalex.org/W2365264209","https://openalex.org/W2384475851","https://openalex.org/W2000444236","https://openalex.org/W962203960","https://openalex.org/W2026999166","https://openalex.org/W2353602216","https://openalex.org/W2587059372","https://openalex.org/W2168798728"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,10,23,73,82,102,142],"scheme":[4,14],"for":[5],"querying":[6],"big":[7],"graphs":[8,110],"with":[9,70,141],"single":[11,143],"machine.":[12],"The":[13],"iteratively":[15],"contracts":[16],"regular":[17],"structures":[18],"into":[19,35],"supernodes":[20,45],"and":[21,61,96,129,134,172],"builds":[22],"hierarchy":[24,91,146],"of":[25,52,72,84,124,161],"contracted":[26,109],"graphs,":[27,136,162],"until":[28],"the":[29,32,36,67,90,108,122,127,145],"one":[30],"at":[31],"top":[33],"fits":[34],"memory.":[37],"For":[38],"each":[39],"query":[40,152],"class":[41],"Q":[42,53],"in":[43,111],"use,":[44],"carry":[46],"synopses":[47],"SQ":[48,58],"such":[49,115],"that":[50,116,140,183],"queries":[51],"are":[54],"answered":[55],"by":[56,63,92,121,167],"using":[57],"if":[59],"possible,":[60],"otherwise":[62],"drilling":[64],"down":[65],"to":[66,80,89,106,113,126,149],"next":[68],"level":[69],"decontraction":[71],"bounded":[74,103],"size.":[75],"Moreover,":[76],"we":[77,137],"show":[78],"how":[79],"adapt":[81],"variety":[83],"existing":[85],"sequential":[86],"(single-machine)":[87],"algorithms":[88],"reusing":[93],"their":[94],"logic":[95],"data":[97],"structures.":[98],"We":[99],"also":[100],"provide":[101],"incremental":[104],"algorithm":[105],"maintain":[107],"response":[112],"updates,":[114],"its":[117],"cost":[118],"is":[119,147,156,173],"determined":[120],"sizes":[123],"changes":[125],"input":[128],"output":[130],"only.":[131],"Using":[132],"real-life":[133],"synthetic":[135],"experimentally":[138],"verify":[139],"machine,":[144],"able":[148],"compute":[150],"exact":[151],"answers":[153],"when":[154],"memory":[155],"as":[157,159],"small":[158],"7.6%":[160],"speeds":[163],"up":[164],"various":[165],"applications":[166],"9.8":[168],"times":[169,176],"on":[170],"average,":[171],"even":[174],"120.1":[175],"faster":[177],"than":[178],"some":[179],"parallel":[180],"graph":[181],"systems":[182],"use":[184],"6":[185],"machines.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}