Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)最新文献

LSQB

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464516

Amine Mhedhbi, Matteo Lissandrini, Laurens Kuiper, Jack Waudby, Gábor Szárnyas

引用次数: 8

Networked data and COVID-19 网络数据与COVID-19

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464688

S. Scarpino

{"title":"Networked data and COVID-19","authors":"S. Scarpino","doi":"10.1145/3461837.3464688","DOIUrl":"https://doi.org/10.1145/3461837.3464688","url":null,"abstract":"The COVID-19 pandemic has upended our societies and re-shaped the way we go about our day-to-day lives---from how we work and interact to the way we buy groceries and attend school. Leveraging global data sets that represent billions of people, I will present a series of studies exploring how our behavior [2, 10], mobility patterns [6, 7], and social networks [3, 9] have altered and been altered by COVID-19 and the non-pharmaceutical interventions implemented to control its spread. Next, I will examine how we can better incorporate stochasticity and social network heterogeneity [4] and link directionality [1] into forecasting pandemic risk. With these results, I will demonstrate how the complexity of COVID-19 creates epistemological challenges associated with model identifiability [5, 8, 11]. Finally, I will discuss work by Global.health, a new collaborative network of researchers, technologists, and public health experts that has developed and built an open access platform for collecting, storing, securing, and sharing anonymized, individual-level COVID-19 data. Currently, our data includes almost 30M individual-level cases from 160 countries, which are tagged with up to 40 fields of meta-data. Writing for The New York Times Magazine, Steven Johnson said the data captured by Global.health, \"may well be the single most accurate portrait of the virus's spread through the human population in existence.\"","PeriodicalId":102703,"journal":{"name":"Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131891389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Context-free path querying with all-path semantics by matrix multiplication 通过矩阵乘法实现全路径语义的上下文无关路径查询

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464513

Rustam Azimov, I. Epelbaum, S. Grigorev

{"title":"Context-free path querying with all-path semantics by matrix multiplication","authors":"Rustam Azimov, I. Epelbaum, S. Grigorev","doi":"10.1145/3461837.3464513","DOIUrl":"https://doi.org/10.1145/3461837.3464513","url":null,"abstract":"Context-Free Path Querying (CFPQ) allows one to use context-free grammars as path constraints in navigational graph queries. Many algorithms for CFPQ were proposed but recently showed that the state-of-the-art CFPQ algorithms are still not performant enough for practical use. One promising way to achieve high-performance solutions for graph querying problems is to reduce them to linear algebra operations. Recently, there are two CFPQ solutions formulated in terms of linear algebra: the one based on the Boolean matrix multiplication operation proposed by Azimov et al. (2018) and the Kronecker product-based CFPQ algorithm proposed by Orachev et al. (2020). However, the algorithm based on matrix multiplication still does not support the most expressive all-path query semantics and cannot be truly compared with Kronecker product-based CFPQ algorithm. In this work, we introduce a new matrix-based CFPQ algorithm with all-path query semantics that allows us to extract all found paths for each pair of vertices. Also, we implement our algorithm by using appropriate high-performance libraries for linear algebra. Finally, we provide a comparison of the most performant linear algebra-based CFPQ algorithms for different query semantics.","PeriodicalId":102703,"journal":{"name":"Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134600765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

R2GSync and edge views: practical RDBMS to GDBMS synchronization R2GSync和边缘视图:实用的RDBMS到GDBMS同步

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464515

Nafisa Anzum, S. Salihoglu

引用次数: 0

Graph processing systems back to the future 图形处理系统回到未来

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464687

A. Bonifati

{"title":"Graph processing systems back to the future","authors":"A. Bonifati","doi":"10.1145/3461837.3464687","DOIUrl":"https://doi.org/10.1145/3461837.3464687","url":null,"abstract":"Graphs are data model abstractions that are becoming pervasive in several real-life applications and use cases. In these settings, users focus on entities and their relationships, further enhanced with multiple labels and properties to form the so called property graphs. Modern graph processing systems need to keep pace with the increasing fundamental requirements of these applications and to tackle unforeseen challenges. Motivated by a community vision on future graph processing systems [6], in this talk I will present the system challenges that are lying behind the current research topics on graph processing and graph analytics. Many current graph query engines support subsets of graph queries that they can efficiently evaluate, thus disregarding more expressive query fragments on top of property graphs [2]. It becomes crucial to address efficient query evaluation for complex graph queries, as well the extensibility of the underlying graph query and constraint languages [1, 3]. Moreover, the dynamic aspects [5] of evaluating queries on streaming graphs are equally important and need to be considered in ongoing and future benchmarking efforts [4]. The overarching goal of my talk is to touch upon our past and ongoing work on these topics and to pinpoint the research directions shaping the already bright future of graph processing systems.","PeriodicalId":102703,"journal":{"name":"Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128694273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Large-scale influence maximization with the influence maximization benchmarker suite 使用影响力最大化基准套件实现大规模影响力最大化

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464510

H. Geppert, Sukanya Bhowmik, K. Rothermel

{"title":"Large-scale influence maximization with the influence maximization benchmarker suite","authors":"H. Geppert, Sukanya Bhowmik, K. Rothermel","doi":"10.1145/3461837.3464510","DOIUrl":"https://doi.org/10.1145/3461837.3464510","url":null,"abstract":"Maximizing the influence of a fixed size seed set in a graph was investigated intensively in the past decade. Two very relevant questions are 1) how to solve the influence maximization problem on very large graphs within short time and 2) how to compare possible findings with the current state-of-the-art in a fair manner. To solve the first problem, proxy-based influence maximization strategies emerged. However, today's graphs became too large to be solved quickly for many well-established proxy strategies, since they do not scale to such large graphs. In this paper we propose 1) a novel update scheme for iterative influence maximization strategies named Update Approximation (UA) capable of large influence spreads within a few seconds on billion-scale graphs. Further, we present 2) a generic benchmark suite (Influence Maximization Benchmarker --- IMB) to implement and evaluate influence maximization strategies, alongside with implementations for several established strategies. IMB allows for easy to use benchmarks for further research by the community.","PeriodicalId":102703,"journal":{"name":"Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910117","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Position paper: bitemporal dynamic graph analytics 立场文件:双时动态图形分析

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464514

Hassan Halawa, M. Ripeanu

引用次数: 1

A GraphBLAS implementation in pure Java 纯Java中的GraphBLAS实现

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-06-20 DOI: 10.1145/3461837.3464627

Florentin Dörre, Alexander Krause, Dirk Habich, Martin Junghanns

引用次数: 1

Demystifying memory access patterns of FPGA-based graph processing accelerators 揭示基于fpga的图形处理加速器的存储器访问模式

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 2021-03-31 DOI: 10.1145/3461837.3464512

Jonas Dann, Daniel Ritter, H. Fröning

引用次数: 7

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) 第四届ACM SIGMOD图形数据管理经验与系统(等级)与网络数据分析(NDA)联合国际研讨会论文集

Proceedings of the 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) Pub Date : 1900-01-01 DOI: 10.1145/3461837

引用次数: 1