The focus of the GRADES-NDA workshop is the application areas, usage scenarios and open challenges in managing large-scale graph-shaped data. The workshop is a forum for exchanging ideas and methods for mining, querying and learning with real-world network data, developing new common understandings of the problems at hand, sharing of data sets and benchmarks where applicable, and leveraging existing knowledge from different disciplines. Additionally, considering specific techniques (e.g., algorithms, data/index structures) in the context of the systems that implement them, GRADES-NDA aims to present technical contributions inside graph, RDF, and other data management systems on graphs of a large size.
Call for Papers
The goal of GRADES-NDA is to bring together researchers from academia, industry, and government, (1) to create a forum for discussing recent advances in (large-scale) graph data management and analytics systems, as well as propose and discuss novel methods and techniques towards (2) addressing domain specific challenges or (3) handling noise in real-world graphs.
The workshop will be of interest to researchers in the development of novel data-management applications and systems for large-scale graph analytics. More specifically, the intended audience are, but not limited to, academic and industrial computer scientists interested in databases and data mining, machine learning, data streaming, graph theory and algorithms. Along with novel research work, we encourage submissions with demonstrations and case studies from real-life experiences in various domains such as Social Networks, Biological Network Data, Marketing and Media, Business Data Analysis, Healthcare Data, Cybersecurity etc.
Topics of interest include but are not limited to the following.
- Graph query languages, visualization techniques and querying interfaces, and their effective realization
- Graph platform and parallel platforms, e.g., Flink/Gelly, Titan, SPARK/GraphX, GraphLab/PowerGraph, Giraph, GraphChi etc.
- Network data representation, storage, indexing and querying methods.
- Experiences or techniques for graph specific operations such as traversals or inference/reasoning in the context of large data sets and on the systems that implement those operations.
- RDF data management and analytics
- Dynamic Graphs: managing graph updates; graph stream analytics; analyzing evolution and detection of community structures in real-world evolving graphs
- Mining and machine learning on heterogeneous networks -- knowledge graphs etc.
- Graph summarization and sampling
- Game Theory, Social contagion and Information propagation on networks
- Analytics on dirty, noisy, or uncertain graphs
- Spatial and temporal graph analytics
- Analytics on social, biological, retail, marketing, customer care, financial, healthcare, transportation network data sets
- Descriptions of graph data management use cases and query workloads, and experiences with applying data management technologies in such situations
- Vision and systems papers describing potential or real applications and benefits of graph management
Accepted papers will be published by ACM, indexed by DBLP, and would be available in the ACM DL.
- Paper Submission:
March 23April 6, 2020
April 13April 27, 2020
- Camera Ready Submission:
April 27May 11, 2020
- Workshop Date: June 14, 2020
Authors are invited to submit original, unpublished research papers (full and short), demonstrations and case-studies.
Submissions must follow the latest 2-column ACM Master article "sigconf" proceedings LaTeX template with 10pt font size, and should be double-blind. Details on the Anonymity requirements for submitted manuscripts are present at the SIGMOD 2020 Call for Papers page.
- Full papers should be a maximum of 8 pages in length, excluding references and appendix.
- Case studies should be a maximum of 4 pages in length, excluding references and appendix.
- Short papers and demonstration papers should be a maximum of 4 pages in length, excluding references and appendix.
Submissions will be handled through Easychair. To submit click here.
- Renzo Angles, Universidad de Talca
- Marcelo Arenas, PUC Chile
- Alex Averbuch, Neo4j
- Amitabha Bagchi, Indian Institute of Technology, Delhi
- Srikanta Bedathur, Indian Institute of Technology, Delhi
- Peter Boncz, CWI
- Yang Cao, The University of Edinburgh
- Edith Cohen, Google Research
- Mahashweta Das, Visa Research
- Sourav Dutta, Bell Labs, Ireland
- Irini Fundulaki, ICS-Forth
- Sainyam Galhotra, UMass Amherst
- Alberto Garcia-Duran, EPFL
- Kiran Garimella, MIT
- Ricard Gavaldà , UPC Barcelona
- Joan Guisado-Gámez, UPC Barcelona
- Jiawei Han, University of Illinois Urbana-Champaign
- Russ Harmer, CNRS & ENS Lyon
- Jan Hidders, VU Brussels
- Vasiliki Kalavri, Boston University
- Panos Kalnis, King Abdullah University of Science and Technology
- Josep Lluís Larriba-Pey, UPC Barcelona
- Essam Mansour, Concordia University
- Marcus Paradies, DLR
- Arnau Prat-Pérez, Sparsity
- Maya Ramanath, Indian Institute of Technology, Delhi
- Sayan Ranu, Indian Institute of Technology, Delhi
- Erdem Sariyuce, University at Buffalo
- Juan Sequeda, Capsenta Labs
- Julian Shun, MIT
- Yogesh Simmhan, Indian Institute of Science, Bangalore
- Andreas Spitz, Ecole Polytechnique Fédérale de Lausanne
- Gábor Szárnyas, Budapest University of Technology and Economics
- Martin Theobald, University of Luxembourg
- Enara Vijil, IBM
- Hannes Voigt, Neo4j
- Tianxing Wu, Nanyang Technological University
- Yinghui Wu, Washington State University
- Yinglong Xia, Huawei Research
- Oskar van Rest, Oracle
GRADES-NDA is in its third edition, and had successful joint meetings collocated with SIGMOD/PODS 2018 and 2019 respectively. Specifically, it is the merger of the GRADES and NDA workshops, which were each independently organized and successfully held at previous SIGMOD-PODS meetings, GRADES since 2013 and NDA since 2016. The organizers of GRADES and NDA mutually agreed upon to aim for a joint meeting from 2018 onwards.