GRADES-NDA 2018 is the merger of the GRADES and NDA workshops, which were each independently organized at previous SIGMOD-PODS meetings, GRADES since 2013 and NDA since 2016. The focus of GRADES-NDA 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. GRADES-NDA aims to present technical contributions inside graph, RDF and other data management systems on massive graphs.
The purpose of this workshop 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.
Proceeding Downloads
Challenges and innovations in building a product knowledge graph: extended abstract
Knowledge graphs have been used to support a wide range of applications and enhance search results for multiple major search engines, such as Google and Bing. At Amazon we are building a Product Graph, an authoritative knowledge graph for all products ...
In situ graph querying and analytics with graphgen: extended abstract
After several decades of research but limited adoption in practice, graph querying and analytics are finally starting to gain a foothold in the data management landscape. This is driven to a large degree by the increasing desire to model and query the ...
Graphtides: a framework for evaluating stream-based graph processing platforms
- Benjamin Erb,
- Dominik Meißner,
- Frank Kargl,
- Benjamin A. Steer,
- Felix Cuadrado,
- Domagoj Margan,
- Peter Pietzuch
Stream-based graph systems continuously ingest graph-changing events via an established input stream, performing the required computation on the corresponding graph. While there are various benchmarking and evaluation approaches for traditional, batch-...
Regularizing irregularity: bitmap-based and portable sparse matrix multiplication for graph data on GPUs
Graphs can be naturally represented as sparse matrices. The relationship between graph algorithms and linear algebra algorithms is well understood and many graph problems can be abstracted as Sparse General Matrix-Matrix Multiplication (SpGEMM) ...
Context-free path querying by matrix multiplication
Context-free path querying is a technique, which recently gains popularity in many areas, for example, graph databases, bioinformatics, static analysis, etc. In some of these areas, it is often required to query large graphs, and existing algorithms ...
Q-graph: preserving query locality in multi-query graph processing
Arising user-centric graph applications such as route planning and personalized social network analysis have initiated a shift of paradigms in modern graph processing systems towards multi-query analysis, i.e., processing multiple graph queries in ...
Heterogeneous subgraph features for information networks
Networks play an increasingly important role in modelling real-world systems due to their utility in representing complex connections. For predictive analyses, the engineering of node features in such networks is of fundamental importance to machine ...
THoSP: an algorithm for nesting property graphs
Despite the growing popularity of techniques related to graph summarization, a general operator for the flexible nesting of graphs is still missing. We propose a novel nested graph data model and a powerful graph nesting operator. In contrast to ...
An early look at the LDBC social network benchmark's business intelligence workload
- Gábor Szárnyas,
- Arnau Prat-Pérez,
- Alex Averbuch,
- József Marton,
- Marcus Paradies,
- Moritz Kaufmann,
- Orri Erling,
- Peter Boncz,
- Vlad Haprian,
- János Benjamin Antal
In this short paper, we provide an early look at the LDBC Social Network Benchmark's Business Intelligence (BI) workload which tests graph data management systems on a graph business analytics workload. Its queries involve complex aggregations and ...
Bridging the GAP: towards approximate graph analytics
- Anand Padmanabha Iyer,
- Aurojit Panda,
- Shivaram Venkataraman,
- Mosharaf Chowdhury,
- Aditya Akella,
- Scott Shenker,
- Ion Stoica
While there has been a tremendous interest in processing data that has an underlying graph structure, existing distributed graph processing systems take several minutes or even hours to execute popular graph algorithms. However, in several cases, ...
A graph-based framework for analyzing SQL query logs
Analytical SQL queries are a valuable source of information. Query log analysis can provide insight into the usage of datasets and uncover knowledge that cannot be inferred from source schemas or content alone. To unlock this potential, flexible ...
Two for one: querying property graph databases using SPARQL via gremlinator
In the past decade Knowledge graphs have become very popular and frequently rely on the Resource Description Framework (RDF) or Property Graphs (PG) as their data models. However, the query languages for these two data models - SPARQL for RDF and the PG ...
Index Terms
- Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
GRADES-NDA'20 | 15 | 9 | 60% |
GRADES-NDA'19 | 20 | 10 | 50% |
GRADES-NDA '18 | 26 | 10 | 38% |
Overall | 61 | 29 | 48% |