{"title":"Sortledton:一个通用的图数据结构","authors":"Per Fuchs, Domagoj Margan, Jana Giceva","doi":"https://dl.acm.org/doi/10.1145/3604437.3604442","DOIUrl":null,"url":null,"abstract":"<p>Despite the wide adoption of graph processing across many different application domains, there is no underlying data structure that can serve a variety of graph workloads (analytics, traversals, and pattern matching) on dynamic graphs with single edge updates updates.</p>","PeriodicalId":501169,"journal":{"name":"ACM SIGMOD Record","volume":"250 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sortledton: a Universal Graph Data Structure\",\"authors\":\"Per Fuchs, Domagoj Margan, Jana Giceva\",\"doi\":\"https://dl.acm.org/doi/10.1145/3604437.3604442\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Despite the wide adoption of graph processing across many different application domains, there is no underlying data structure that can serve a variety of graph workloads (analytics, traversals, and pattern matching) on dynamic graphs with single edge updates updates.</p>\",\"PeriodicalId\":501169,\"journal\":{\"name\":\"ACM SIGMOD Record\",\"volume\":\"250 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGMOD Record\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604442\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGMOD Record","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/https://dl.acm.org/doi/10.1145/3604437.3604442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Despite the wide adoption of graph processing across many different application domains, there is no underlying data structure that can serve a variety of graph workloads (analytics, traversals, and pattern matching) on dynamic graphs with single edge updates updates.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
