Demirci, Gündüz VehbiFerhatosmanoğlu, H.Aykanat, Cevdet2020-02-032020-02-0320191066-8888http://hdl.handle.net/11693/52999Graph partitioning is an essential task for scalable data management and analysis. The current partitioning methods utilize the structure of the graph, and the query log if available. Some queries performed on the database may trigger further operations. For example, the query workload of a social network application may contain re-sharing operations in the form of cascades. It is beneficial to include the potential cascades in the graph partitioning objectives. In this paper, we introduce the problem of cascade-aware graph partitioning that aims to minimize the overall cost of communication among parts/servers during cascade processes. We develop a randomized solution that estimates the underlying cascades, and use it as an input for partitioning of large-scale graphs. Experiments on 17 real social networks demonstrate the effectiveness of the proposed solution in terms of the partitioning objectives.EnglishGraph partitioningInformation cascadePropagation modelsRandomized algorithmsScalabilitySocial networksArticle10.1007/s00778-018-0531-8