{"id":"https://openalex.org/W2100132188","doi":"https://doi.org/10.1145/2213836.2213855","title":"Query preserving graph compression","display_name":"Query preserving graph compression","publication_year":2012,"publication_date":"2012-05-20","ids":{"openalex":"https://openalex.org/W2100132188","doi":"https://doi.org/10.1145/2213836.2213855","mag":"2100132188"},"language":"en","primary_location":{"id":"doi:10.1145/2213836.2213855","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213836.2213855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM SIGMOD 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/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":true,"raw_author_name":"Wenfei Fan","raw_affiliation_strings":["University of Edinburgh &amp; Harbin Institute of Technology, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh &amp; Harbin Institute of Technology, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100387065","display_name":"Jianzhong Li","orcid":"https://orcid.org/0000-0002-4119-0571"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianzhong Li","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, China","Harbin Institute of Technology Harbin, China#TAB#"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, China","institution_ids":["https://openalex.org/I204983213"]},{"raw_affiliation_string":"Harbin Institute of Technology Harbin, China#TAB#","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061028507","display_name":"Xin Wang","orcid":"https://orcid.org/0000-0001-8969-1415"},"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":"Xin Wang","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom","University of Edinburgh, edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071093153","display_name":"Yinghui Wu","orcid":"https://orcid.org/0000-0003-3991-5155"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]},{"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","US"],"is_corresponding":false,"raw_author_name":"Yinghui Wu","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom &amp; University of California Santa Barbara","University of Edinburgh, Edinburgh, United Kingdom & University of California Santa Barbara#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom &amp; University of California Santa Barbara","institution_ids":["https://openalex.org/I154570441","https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom & University of California Santa Barbara#TAB#","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070565287"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":12.2191,"has_fulltext":false,"cited_by_count":203,"citation_normalized_percentile":{"value":0.99008721,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"157","last_page":"168"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9980999827384949,"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/reachability","display_name":"Reachability","score":0.7582168579101562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6851791143417358},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5330086350440979},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5208519101142883},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5172199010848999},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49701741337776184},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35120394825935364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3215567469596863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24717235565185547}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7582168579101562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6851791143417358},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5330086350440979},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5208519101142883},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5172199010848999},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49701741337776184},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35120394825935364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3215567469596863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24717235565185547},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2213836.2213855","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213836.2213855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.709.3109","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.709.3109","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eecs.wsu.edu/%7Eyinghui/mat/papers/Query%20preserving%20graph%20compression-sigmod2012.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/d4163d09-1a06-4c11-a6d9-772a2ca58b05","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d4163d09-1a06-4c11-a6d9-772a2ca58b05","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3649347000","display_name":null,"funder_award_id":"EP/J015377/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1515993376","https://openalex.org/W1605604022","https://openalex.org/W1854661526","https://openalex.org/W1968895412","https://openalex.org/W1972978715","https://openalex.org/W1983604014","https://openalex.org/W1994727615","https://openalex.org/W1994924587","https://openalex.org/W2022322548","https://openalex.org/W2029852131","https://openalex.org/W2030178622","https://openalex.org/W2043655327","https://openalex.org/W2049354208","https://openalex.org/W2068361557","https://openalex.org/W2076447414","https://openalex.org/W2078331965","https://openalex.org/W2082773934","https://openalex.org/W2097111141","https://openalex.org/W2098817244","https://openalex.org/W2108614537","https://openalex.org/W2108781142","https://openalex.org/W2110920860","https://openalex.org/W2115022330","https://openalex.org/W2115186087","https://openalex.org/W2122710250","https://openalex.org/W2123966888","https://openalex.org/W2152651944","https://openalex.org/W2153204928","https://openalex.org/W2157748587","https://openalex.org/W2161088492","https://openalex.org/W2161728285","https://openalex.org/W2165128972","https://openalex.org/W2165971212","https://openalex.org/W2168682577","https://openalex.org/W2168924255","https://openalex.org/W6676446099","https://openalex.org/W6682753483","https://openalex.org/W6684860022","https://openalex.org/W6685000865"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W4300463216","https://openalex.org/W2772294324","https://openalex.org/W2047831585","https://openalex.org/W4253760428","https://openalex.org/W3115442681","https://openalex.org/W2007838763","https://openalex.org/W4386112722","https://openalex.org/W2391000461","https://openalex.org/W2972311463"],"abstract_inverted_index":{"It":[0],"is":[1],"common":[2],"to":[3,29,35,39,91,118,181,184,240,243],"find":[4],"graphs":[5,21,37,113,152,260],"with":[6],"millions":[7],"of":[8,12,43,45,106,128,139,202,211,214,233],"nodes":[9],"and":[10,80,142,162,216,230,267,273],"billions":[11],"edges":[13],"in,":[14],"e.g.,":[15],"social":[16],"networks.":[17],"Queries":[18],"on":[19,94,228],"such":[20,57],"are":[22,196,207,279],"often":[23],"prohibitively":[24],"expensive.":[25],"These":[26],"motivate":[27],"us":[28],"propose":[30],"query":[31,62,168],"preserving":[32,115],"graph":[33,55,108,143,163,177,187,270],"compression,":[34],"compress":[36],"relative":[38],"a":[40,50,54,158,209],"class":[41],"\u039b":[42,65,73],"queries":[44,121,145],"users'":[46],"choice.":[47],"We":[48,149,171,189],"compute":[49],"small":[51],"Gr":[52,95,178,242],"from":[53,78],"G":[56],"that":[58,151,191,225,254,274],"(a)":[59],"for":[60,84,136,174,198,265,269],"any":[61,82],"Q":[63],"\u0395":[64,72],"Q,":[66],"Q(G)":[67,86],"=":[68],"Q'(Gr),":[69],"where":[70],"Q'":[71,93],"can":[74,87,153],"be":[75,88,154],"efficiently":[76,155],"computed":[77],"Q;":[79],"(b)":[81],"algorithm":[83],"computing":[85],"directly":[89],"applied":[90],"evaluating":[92,107],"as":[96],"is.":[97],"That":[98],"is,":[99],"while":[100,114,166],"we":[101,110,132,221,236,251],"cannot":[102],"lower":[103],"the":[104,116,120,126,185,192,199,212,245],"complexity":[105],"queries,":[109,203],"reduce":[111,259],"data":[112],"answers":[117],"all":[119],"in":[122,179,218,261],"\u039b.":[123],"To":[124],"verify":[125,253],"effectiveness":[127],"this":[129],"approach,":[130],"(1)":[131],"develop":[133,222],"compression":[134,256],"strategies":[135],"two":[137,200],"classes":[138],"queries:":[140],"reachability":[141,159,266],"pattern":[144,271],"via":[146,157],"(bounded)":[147],"simulation.":[148],"show":[150,190],"compressed":[156,176],"equivalence":[160],"relation":[161],"bisimulation,":[164],"respectively,":[165],"reserving":[167],"answers.":[169],"(2)":[170],"provide":[172],"techniques":[173,257],"aintaining":[175],"response":[180],"changes":[182,217],"\u0394G":[183,215,229],"original":[186],"G.":[188],"incremental":[193,223,276],"maintenance":[194,277],"problems":[195],"unbounded":[197],"lasses":[201],"i.e.,":[204,235],"their":[205],"costs":[206],"not":[208,238],"function":[210],"size":[213],"Gr.":[219],"Nevertheless,":[220],"algorithms":[224,278],"depend":[226],"only":[227],"Gr,":[231],"independent":[232],"G,":[234],"do":[237],"have":[239],"decompress":[241],"propagate":[244],"changes.":[246],"(3)":[247],"Using":[248],"real-life":[249],"data,":[250],"experimentally":[252],"our":[255,275],"could":[258],"average":[262],"by":[263],"95%":[264],"57%":[268],"matching,":[272],"efficient.":[280]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":27},{"year":2018,"cited_by_count":24},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
