Sixth International Workshop on

High Performance Big Graph Data

Management, Analysis, and Mining

December 12, 2019

To be held in conjunction with the

2019 IEEE International Conference on Big Data (IEEE BigData 2019)
The Westin Bonaventure Hotel & Suites, Los Angeles, CA, USA

Workshop Description

Modern Big Data increasingly appears in the form of complex graphs and networks. Examples include the physical Internet, the world wide web, online social networks, phone networks, and biological networks. In addition to their massive sizes, these graphs are dynamic, noisy, and sometimes transient. They also conform to all five Vs (Volume, Velocity, Variety, Value and Veracity) that define Big Data. However, many graph-related problems are computationally difficult, and thus big graph data brings unique challenges, as well as numerous opportunities for researchers, to solve various problems that are significant to our communities.

Big graph problems are currently solved using several complementary paradigms. The most popular approach is perhaps by exploiting parallelism, through specialized algorithms for supercomputers, shared-memory multicore and manycore systems, and heterogeneous CPU-GPU systems. However, since real-world graphs are sparse and highly irregular, there are very few parallel implementations that can actually deliver high performance. The major challenges to scaling and efficiency include irregular data dependencies, poor locality, and high synchronization costs of current approaches. In addition to parallelism, researchers are developing approximation algorithms that use sampling for compressing and summarizing graph data. Streaming algorithms are also being considered for scenarios where the rate of updates is too fast to process the entire graph in a single pass. Further, out-of-core algorithms are necessary for massive graphs that do not fit in the main memory of a typical system. Researchers can use graph-based solutions for solving problems from many diverse disciplines, including routing and transportation, social networks, bioinformatics, computational science, health care, security and intelligence analysis.

This workshop aims to bring together researchers from different paradigms solving big graph problems under a unified platform for sharing their work and exchanging ideas. We are soliciting novel and original research contributions related to big graph data management, analysis, and mining (algorithms, software systems, applications, best practices, performance). Significant work-in-progress papers are also encouraged. Papers can be from any of the following areas, including but not limited to:

Regular paper submissions must be at most 10 pages long, including all figures, tables, and references. They must be formatted according to the paper submission formatting guidelines provided in the IEEE BigData 2019 Call for Papers. Additionally, we encourage short paper submissions (at most 6 pages) describing new work in progress.

Past Workshops

BigGraphs 2014
BigGraphs 2015
BigGraphs 2016
BigGraphs 2017
BigGraphs 2018

Important Dates

Keynote

Tim Weninger
Tim Weninger
University of Notre Dame

Talk title: Principled Structure Discovery from Graph Data

Workshop Program

December 12, 2019
8:15 am -- 12.10 pm

Location: San Pedro, Lobby Level, The Westin Bonaventure Hotel & Suites, Los Angeles, CA, USA

20-minute oral presentation of papers (17-minute talk and 3 minutes for Q&A)

8:15 am Opening remarks
Shaikh Arifuzzaman and Mohammad Hasan

8:20 am Keynote by Prof. Tim Weninger

9:25 am Computing Complex Graph Properties with SQL Queries
Xiantian Zhou and Carlos Ordonez

9:45 am Network Embedding: on Compression and Learning
Esra Akbas and Mehmet Aktas

10:05 am Distributed Community Detection in Large Networks using An Information-Theoretic Approach
Md Abdul Motaleb Faysal and Shaikh Arifuzzaman

10:25 am Coffee break

11:00 am A Scalable Graph Analytics Framework for Programming with Big Data in R
M. Shamimul Hasan, Drew Schmidt, Ramakrishnan Kannan, and Neena Imam

11:20 am Efficient similarity-based alignment of temporally-situated graph nodes with Apache Spark
Hubert Naacke, Ke Li, Bernd Amann, and Olivier Curé

11:40 am GraphEvo: Characterizing and Understanding Software Evolution using Call Graphs
Vijay Walunj, Gharib Gharibi, Duy Ho, and Yugyung Lee

12:00 pm Closing remarks
Mohammad Hasan and Shaikh Arifuzzaman

Workshop Organizers

Nesreen Ahmed
Nesreen Ahmed
Intel Labs
Santa Clara, CA 95054

Mohammad Al Hasan
Mohammad Al Hasan
Department of Computer and Information Science
Indiana University - Purdue University
Indianapolis, IN 46202

Shaikh Arifuzzaman
Shaikh Arifuzzaman
Department of Computer Science
The University of New Orleans
New Orleans, LA 70148

Kamesh Madduri
Kamesh Madduri
Department of Computer Science and Engineering
The Pennsylvania State University
University Park, PA 16802

Program Committee

Nesreen Ahmed, Intel Labs
Mohammad Al Hasan, Indiana University - Purdue University
Shad Kirmani, eBay
John Boaz Lee, Worcester Polytechnic Institute
Kamesh Madduri, Pennsylvania State University
Ryan Rossi, Adobe Research
Hongyuan Zhan, Facebook
Rong Zhou, Google

Contact

Please send email to one of the workshop organizers.