Differences

This shows you the differences between two versions of the page.

Link to this comparison view

projects:graph [2014/07/03 07:14]
bgedik [Online disk layout management for interaction graphs]
projects:graph [2017/02/09 13:45] (current)
Line 1: Line 1:
 +~~NOTOC~~ 
 +====== Large-scale graph processing systems and algorithms ======
 +In this project, we are studying parallel, distributed, and stream processing techniques for managing large-scale graphs. Such graphs are becoming increasingly common in application domains like social network analytics, web graph analysis, bioinformatics, etc. These graphs can be highly dynamic, very large, or both dynamic and large. We investigate system-level as well as analytic techniques for addressing resulting challenges.
  
 +=====BSP graph processing on SMPs=====
 +In this project, we look at system level techniques to improve performance of BSP style (Pregel-like) graph processing infrastructures on shared memory processors (SMPs). 
 +
 +=====Streaming algorithms for graph management=====
 +In this project, we look at incremental maintenance of important graph structures (such as k-core, k-truss, communities, etc.) in the presence of dynamic changes to the graph in a distributed setup (for very large graphs).
 +
 +=====Online disk layout management for interaction graphs=====
 +Interaction graphs are append-only temporal graphs where interactions between entities are continuously added. In this project we look at streaming algorithms to best package edges to disk blocks, so that disk based interaction graph DBs can perform query processing more efficiently w.r.t. disk I/O.
 +
 +=====Adaptive disk layout management for interaction graphs=====
 +In this project we investigate optimizing disk access for interaction graphs that contain large amounts of attribute data, in addition to the graph data. The focus is on adaptive storage layout optimization based on runtime workload characteristics.
 +
 +
 +====== Publications ======
 +  * Ahmet Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek. "Streaming Algorithms for k-core Decomposition", Very Large Data Bases Conference (VLDB), 2013.
 +  * Ahmet Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek., "SONIC: Streaming Overlapping Community Detection", Submitted.
 +  * Ahmet Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek. "Streaming k-core Decomposition: Algorithms and Analysis", In Preparation.
 +  * Buğra Gedik, Rajesh Bordawekar. "Temporal Storage and Querying of Evolving Interaction Graphs", Transactions in Knowledge and Data Engineering, IEEE (TKDE), 2014.
 +    
 +====== Collaborators ======
 +  * Erdem Sarıyüce, Ohio State University
 +  * Gabriela Jacques da Silva, IBM T. J. Watson Research Center
 +  * Kun-Lung Wu, IBM T. J. Watson Research Center
 +  * Rajesh Bordawekar, IBM T. J. Watson Research Center
 +  * Robert Soulé, University of Lugano (USI)
 +