In order to give researchers interested in graph data management a single venue to go to, the chairs of GRADES and the NDA (Network Data Analytics) workshop have decided to merge their schedules and co-locate in the same room! Therefore, we are delighted to offer you a strong integrated program.

The workshops offers both talks and interactive sessions with poster presentations, so researchers can interact maximally. All contributed GRADES and NDA papers have a poster presentation and GRADES also accepted four poster-only papers.

• 08:45-09:00 Welcome
• 10:00-12:30 NDA program (see NDA website)
• 12:30-14:00 Lunch Break
• 14:00-15:00 Keynote Talk: (invited by NDA)
  • Construction of Structured Heterogeneous Networks from Massive Text Data.
    Jiawei Han (Abel Bliss Professor, University of Illinois at Urbana-Champaign) (recording)
• 15:00-15:30 GRADES short talks
  • GraphGen: Adaptive Graph Extraction and Analytics over Relational Databases.
    Konstantinos Xirogiannopoulos (University of Maryland at College Park), Virinchi Srinivas (University of Maryland at College Park), Amol Deshpande (University of Maryland at College Park) slides (recording)
  • Towards a property graph generator for benchmarking.
    Arnau Prat, Joan Guisado-Gamez, Xavier Fernandez-Salas (DAMA-UPC), Petr Koupy, Siegfried Depner, Davide Basilio Bartolini (Oracle Labs) slides (recording)
  • Entropy-based selection of Graph Cuboids.
    Dritan Bleco, and Yannis Kotidis (Athens University of Economics and Business) slides (recording)
• 15:30-16:00 Coffee Break (with posters in the room)
• 16:00-17:00 GRADES short talks
  • Granula: Towards Fine-grained Performance Analysis of Large-scale Graph Processing Platforms.
    Wing Lung Ngai (Vrije Universiteit Amsterdam), Tim Hegeman (Delft University of Technology), Stijn Heldens (University of Twente), Alexandru Iosup (Vrije Universiteit Amsterdam) slides (recording)
  • PGX.D Async: A Scalable Distributed Graph Pattern Matching Engine.
    Nicholas P. Roth, Vasileios Trigonakis, Sungpack Hong, Hassan Chafi (Oracle Labs), Anthony Potter, Boris Motik, Ian Horrocks (University of Oxford) slides (recording)
  • Cypher-based Graph Pattern Matching in Gradoop.
    Martin Junghanns, Max Kießling (University of Leipzig), Alex Averbuch (Neo Technology), André Petermann, Erhard Rahm (University of Leipzig) slides (recording)
  • SPARQL Graph Pattern Processing with Apache Spark.
    Hubert Naacke, Bernd Amann, Olivier Cure (Universitéierre et Marie Curie) slides (recording)
  • Extending SQL for Computing Shortest Paths.
    Dean De Leo, Peter Boncz (CWI) slides (recording)
  • An Analysis of the Feasibility of Graph Compression Techniques for Indexing Regular Path Queries.
    Frank Tetzel, Hannes Voigt (TU Dresden), Marcus Paradies (SAP), Wolfgang Lehner (TU Dresden) slides (recording)
• 17:00-18:00 Closing Poster Session. The poster sessions present all GRADES and NDA contributed papers, plus posters for the following poster papers:
  • Cytosm: Declarative Property Graph Queries Without Data Migration.
    Benjamin Steer (Queen Mary University London), Alhamza Alnaimi, Marco Lotz (Hewlett Packard Labs), Felix Cuadrado (Queen Mary University of London), Luis Vaquero, Joan Varvenne (Hewlett Packard Labs)
  • Can Modern Graph Processing Engines Run Concurrent Queries?
    Matthias Hauck (University of Heidelberg), Marcus Paradies (SAP), Holger Froening (University of Heidelberg)
  • Do We Need Specialized Graph Databases? Benchmarking Real-Time Social Networking Applications.
    Anil Pacaci (University of Waterloo), Alice Zhou (University of Waterloo), Jimmy Lin (University of Waterloo), Tamer Öszu (University of Waterloo)
  • Finding Top K Shortest Simple Paths with Improved Space Efficiency.
    Qingsong Wen, Ren Chen (Huawei America Research Lab), Lifeng Nai (Institute of Technology), Li Zhou (Gatech), Yinglong Xia (Huawei America Research Lab)