Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3210259acmconferencesBook PagePublication PagesmodConference Proceedingsconference-collections
GRADES-NDA '18: Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)
ACM2018 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SIGMOD/PODS '18: International Conference on Management of Data Houston Texas 10 June 2018
ISBN:
978-1-4503-5695-4
Published:
10 June 2018
Sponsors:

Reflects downloads up to 21 Nov 2024Bibliometrics
Skip Abstract Section
Abstract

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.

Skip Table Of Content Section
invited-talk
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 ...

invited-talk
Public Access
In situ graph querying and analytics with graphgen: extended abstract
Article No.: 2, Pages 1–2https://doi.org/10.1145/3210259.3210261

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 ...

research-article
Graphtides: a framework for evaluating stream-based graph processing platforms
Article No.: 3, Pages 1–10https://doi.org/10.1145/3210259.3210262

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-...

research-article
Public Access
Regularizing irregularity: bitmap-based and portable sparse matrix multiplication for graph data on GPUs
Article No.: 4, Pages 1–8https://doi.org/10.1145/3210259.3210263

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) ...

research-article
Context-free path querying by matrix multiplication
Article No.: 5, Pages 1–10https://doi.org/10.1145/3210259.3210264

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 ...

research-article
Q-graph: preserving query locality in multi-query graph processing
Article No.: 6, Pages 1–10https://doi.org/10.1145/3210259.3210265

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 ...

research-article
Heterogeneous subgraph features for information networks
Article No.: 7, Pages 1–9https://doi.org/10.1145/3210259.3210266

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 ...

research-article
THoSP: an algorithm for nesting property graphs
Article No.: 8, Pages 1–10https://doi.org/10.1145/3210259.3210267

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 ...

short-paper
An early look at the LDBC social network benchmark's business intelligence workload
Article No.: 9, Pages 1–11https://doi.org/10.1145/3210259.3210268

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 ...

short-paper
Bridging the GAP: towards approximate graph analytics
Article No.: 10, Pages 1–5https://doi.org/10.1145/3210259.3210269

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, ...

demonstration
A graph-based framework for analyzing SQL query logs
Article No.: 11, Pages 1–5https://doi.org/10.1145/3210259.3210270

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 ...

demonstration
Two for one: querying property graph databases using SPARQL via gremlinator
Article No.: 12, Pages 1–5https://doi.org/10.1145/3210259.3210271

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 ...

Contributors
  • Indian Institute of Technology Kanpur
  • Eindhoven University of Technology
  • Polytechnic University of Catalonia
  • Xerox Research Center India

Index Terms

  1. Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)
      Index terms have been assigned to the content through auto-classification.
      Please enable JavaScript to view thecomments powered by Disqus.

      Recommendations

      Acceptance Rates

      GRADES-NDA '18 Paper Acceptance Rate 10 of 26 submissions, 38%;
      Overall Acceptance Rate 29 of 61 submissions, 48%
      YearSubmittedAcceptedRate
      GRADES-NDA'2015960%
      GRADES-NDA'19201050%
      GRADES-NDA '18261038%
      Overall612948%