{"id":"https://openalex.org/W4387007295","doi":"https://doi.org/10.1145/3603165.3607457","title":"Accelerating Incremental Graph Processing by Layering Graph","display_name":"Accelerating Incremental Graph Processing by Layering Graph","publication_year":2023,"publication_date":"2023-07-28","ids":{"openalex":"https://openalex.org/W4387007295","doi":"https://doi.org/10.1145/3603165.3607457"},"language":"en","primary_location":{"id":"doi:10.1145/3603165.3607457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3603165.3607457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Turing Award Celebration Conference - China 2023","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/A5079250744","display_name":"Shufeng Gong","orcid":"https://orcid.org/0000-0001-5898-5621"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shufeng Gong","raw_affiliation_strings":["School of Computer Science and Engineering, Northeastern University, China"],"raw_orcid":"https://orcid.org/0000-0001-5898-5621","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046899033","display_name":"Song Yu","orcid":"https://orcid.org/0009-0008-0351-0432"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Song Yu","raw_affiliation_strings":["School of Computer Science and Engineering, Northeastern University, China"],"raw_orcid":"https://orcid.org/0009-0008-0351-0432","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100367496","display_name":"Yanfeng Zhang","orcid":"https://orcid.org/0000-0002-9871-0304"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanfeng Zhang","raw_affiliation_strings":["School of Computer Science and Engineering, Northeastern University, China"],"raw_orcid":"https://orcid.org/0000-0002-9871-0304","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072406974","display_name":"Ge Yu","orcid":"https://orcid.org/0000-0002-3171-8889"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ge Yu","raw_affiliation_strings":["School of Computer Science and Engineering, Northeastern University, China"],"raw_orcid":"https://orcid.org/0000-0002-3171-8889","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Northeastern University, China","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11150044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"160","last_page":"161"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/null-graph","display_name":"Null graph","score":0.647765576839447},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.5887018442153931},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5850858688354492},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.5628415942192078},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.5608185529708862},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5309115648269653},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5195865631103516},{"id":"https://openalex.org/keywords/simplex-graph","display_name":"Simplex graph","score":0.5084794759750366},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4943962097167969},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.45495903491973877},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38797086477279663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34881627559661865}],"concepts":[{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.647765576839447},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.5887018442153931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5850858688354492},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.5628415942192078},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.5608185529708862},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5309115648269653},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5195865631103516},{"id":"https://openalex.org/C202183611","wikidata":"https://www.wikidata.org/wiki/Q7520883","display_name":"Simplex graph","level":5,"score":0.5084794759750366},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4943962097167969},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.45495903491973877},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38797086477279663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34881627559661865}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3603165.3607457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3603165.3607457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Turing Award Celebration Conference - China 2023","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2928052000","https://openalex.org/W3159345041","https://openalex.org/W3173178674","https://openalex.org/W3175214555","https://openalex.org/W3208514862","https://openalex.org/W4241946628"],"related_works":["https://openalex.org/W2954009223","https://openalex.org/W2278094798","https://openalex.org/W2108781142","https://openalex.org/W2900680118","https://openalex.org/W2048112267","https://openalex.org/W2071056049","https://openalex.org/W2793949464","https://openalex.org/W2964146318","https://openalex.org/W2273247918","https://openalex.org/W2267695370"],"abstract_inverted_index":{"By":[0],"using":[1],"the":[2,21,46,53,57,71,75,85],"memoized":[3],"previous":[4],"computation":[5,9],"state,":[6],"incremental":[7,98],"graph":[8,23,37,47,73,77,87,99],"can":[10],"reduce":[11],"unnecessary":[12],"recomputation.":[13],"However,":[14],"a":[15,35,43,80],"small":[16,76],"change":[17],"may":[18],"propagate":[19],"over":[20],"whole":[22],"and":[24,56,79],"lead":[25],"to":[26,74],"large-scale":[27],"iterative":[28,68],"computations.":[29],"For":[30],"this,":[31],"we":[32],"propose":[33],"Layph,":[34],"two-layered":[36],"framework.":[38],"The":[39],"upper":[40],"layer":[41,59],"is":[42,49],"skeleton":[44,78],"of":[45],"which":[48],"much":[50],"smaller":[51],"than":[52],"original":[54,72],"graph,":[55],"lower":[58],"has":[60],"some":[61],"disjoint":[62],"subgraphs.":[63],"Layph":[64,94],"limits":[65],"costly":[66],"global":[67],"computations":[69],"on":[70],"few":[81],"subgraphs":[82],"updated":[83],"with":[84],"input":[86],"changes.":[88],"Our":[89],"experimental":[90],"results":[91],"show":[92],"that":[93],"outperforms":[95],"current":[96],"state-of-the-art":[97],"systems":[100],"in":[101],"response":[102],"time.":[103]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}