{"id":"https://openalex.org/W2613159091","doi":"https://doi.org/10.1145/3035918.3035944","title":"Incremental Graph Computations","display_name":"Incremental Graph Computations","publication_year":2017,"publication_date":"2017-05-09","ids":{"openalex":"https://openalex.org/W2613159091","doi":"https://doi.org/10.1145/3035918.3035944","mag":"2613159091"},"language":"en","primary_location":{"id":"doi:10.1145/3035918.3035944","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3035918.3035944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/8df51397-d330-4cf3-9ae4-c1cb70d1c152","any_repository_has_fulltext":true},"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 & Beihang University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh & Beihang University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086470621","display_name":"Chunming Hu","orcid":"https://orcid.org/0000-0002-9502-3955"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chunming Hu","raw_affiliation_strings":["Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100675047","display_name":"Chao Tian","orcid":"https://orcid.org/0000-0002-9670-367X"},"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":"Chao Tian","raw_affiliation_strings":["University of Edinburgh & Beihang University, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh & Beihang University, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070565287"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":3.235,"has_fulltext":true,"cited_by_count":80,"citation_normalized_percentile":{"value":0.95377106,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"169"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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/graph-traversal","display_name":"Graph traversal","score":0.6913164854049683},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6108300685882568},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5987406969070435},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5270068049430847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47235211730003357},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4721560478210449},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4582769572734833},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4330528676509857},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40521106123924255},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.38391172885894775},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.3759163022041321},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33827072381973267},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25931718945503235}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6913164854049683},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6108300685882568},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5987406969070435},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5270068049430847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47235211730003357},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4721560478210449},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4582769572734833},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4330528676509857},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40521106123924255},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.38391172885894775},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.3759163022041321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33827072381973267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25931718945503235},{"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/3035918.3035944","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3035918.3035944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/8df51397-d330-4cf3-9ae4-c1cb70d1c152","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=3035944","pdf_url":"https://www.research.ed.ac.uk/en/publications/8df51397-d330-4cf3-9ae4-c1cb70d1c152","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:openaire/8df51397-d330-4cf3-9ae4-c1cb70d1c152","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/8df51397-d330-4cf3-9ae4-c1cb70d1c152","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fan, W, Hu, C & Tian, C 2017, Incremental Graph Computations: Doable and Undoable. in SIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data. pp. 155-169, 2017 ACM International Conference on Management of Data, Chicago, Illinois, United States, 14/05/17. https://doi.org/10.1145/3035918.3035944","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/8df51397-d330-4cf3-9ae4-c1cb70d1c152","is_oa":true,"landing_page_url":"http://dl.acm.org/citation.cfm?id=3035944","pdf_url":"https://www.research.ed.ac.uk/en/publications/8df51397-d330-4cf3-9ae4-c1cb70d1c152","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1121271761","display_name":null,"funder_award_id":"Program","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G1477544716","display_name":null,"funder_award_id":"Guangdong","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G391238517","display_name":null,"funder_award_id":", and","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6325207691","display_name":null,"funder_award_id":"61133002 and 61602023","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7174558747","display_name":null,"funder_award_id":"Group","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8400180575","display_name":null,"funder_award_id":"EP/M025268/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"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/F4320329053","display_name":"Beijing Advanced Innovation Center for Big Data and Brain Computing","ror":null},{"id":"https://openalex.org/F4320333334","display_name":"Guangdong Province Introduction of Innovative R&D Team","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2613159091.pdf","grobid_xml":"https://content.openalex.org/works/W2613159091.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W1009523478","https://openalex.org/W1563056472","https://openalex.org/W1592186521","https://openalex.org/W1623511323","https://openalex.org/W1812691494","https://openalex.org/W1854661526","https://openalex.org/W1981585544","https://openalex.org/W1993219230","https://openalex.org/W1995307698","https://openalex.org/W2010929544","https://openalex.org/W2012670464","https://openalex.org/W2029706450","https://openalex.org/W2035767178","https://openalex.org/W2035829578","https://openalex.org/W2039984653","https://openalex.org/W2043657122","https://openalex.org/W2049354208","https://openalex.org/W2055688322","https://openalex.org/W2062705952","https://openalex.org/W2064390618","https://openalex.org/W2094985106","https://openalex.org/W2097284499","https://openalex.org/W2109097687","https://openalex.org/W2118260817","https://openalex.org/W2118382442","https://openalex.org/W2119059501","https://openalex.org/W2124212956","https://openalex.org/W2126917089","https://openalex.org/W2128744826","https://openalex.org/W2129743596","https://openalex.org/W2135282325","https://openalex.org/W2138295324","https://openalex.org/W2139666321","https://openalex.org/W2147405597","https://openalex.org/W2157748587","https://openalex.org/W2158700338","https://openalex.org/W2169624745","https://openalex.org/W2171874178","https://openalex.org/W2252148092","https://openalex.org/W2425348221","https://openalex.org/W2603136608","https://openalex.org/W2613088476","https://openalex.org/W4213009134","https://openalex.org/W4230201548","https://openalex.org/W6678039277","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W3183956626","https://openalex.org/W2136735429"],"abstract_inverted_index":{"The":[0],"incremental":[1,112],"problem":[2],"for":[3,97],"a":[4,14,58],"class":[5],"Q":[6,16],"of":[7,64],"graph":[8,19,99,103],"queries":[9,100],"aims":[10],"to":[11,27,34,73,80],"compute,":[12],"given":[13],"query":[15],"in":[17,61],"'Q,":[18],"G,":[20],"output":[21],"Q(G)":[22,35,43],"and":[23,68,84,108],"updates":[24],"\u0394":[25,32,40,45,66,69,82,85],"G":[26,28,67,79,83],"as":[29,57,102],"input,":[30],"changes":[31],"O":[33],"such":[36,101],"that":[37],"Q(G":[38],"\u2295":[39,44],"G)":[41],"=":[42],"O.":[46,70,86],"It":[47,71],"is":[48,72],"called":[49],"bounded":[50],"if":[51],"its":[52],"cost":[53],"can":[54],"be":[55],"expressed":[56],"polynomial":[59],"function":[60],"the":[62],"sizes":[63],"Q,":[65],"reduce":[74],"computations":[75],"on":[76],"possibly":[77],"big":[78],"small":[81],"No":[87],"matter":[88],"how":[89],"desirable,":[90],"however,":[91],"our":[92],"first":[93],"results":[94],"are":[95,114],"negative:":[96],"common":[98],"traversal,":[104],"connectivity,":[105],"keyword":[106],"search":[107],"pattern":[109],"matching,":[110],"their":[111],"problems":[113],"unbounded.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}