124 citations · 157 across the 6 of their papers we have counts for
6 papers
Mining Frequent Patterns in Evolving Graphs
Cigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales +1
Given a labeled graph, the frequent-subgraph mining (FSM) problem asks to find all the -vertex subgraphs that appear with frequency greater than a given threshold. FSM has numer…
Load Balancing for Skewed Streams on Heterogeneous Cluster
Muhammad Anis Uddin Nasir, Hiroshi Horii, Marco Serafini +4
Streaming applications frequently encounter skewed workloads and execute on heterogeneous clusters. Optimal resource utilization in such adverse conditions becomes a challenge, as…
Fully Dynamic Algorithm for Top- Densest Subgraphs
Muhammad Anis Uddin Nasir, Aristides Gionis, Gianmarco De Francisci Morales +1
Given a large graph, the densest-subgraph problem asks to find a subgraph with maximum average degree. When considering the top- version of this problem, a naïve solution is to…
Fault Tolerance for Stream Processing Engines
Muhammad Anis Uddin Nasir
Distributed Stream Processing Engines (DSPEs) target applications related to continuous computation, online machine learning and real-time query processing. DSPEs operate on high v…
Socially-Aware Distributed Hash Tables for Decentralized Online Social Networks
Muhammad Anis Uddin Nasir, Sarunas Girdzijauskas, Nicolas Kourtellis
Many decentralized online social networks (DOSNs) have been proposed due to an increase in awareness related to privacy and scalability issues in centralized social networks. Such…
The Power of Both Choices: Practical Load Balancing for Distributed Stream Processing Engines
Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, David García-Soriano +2
We study the problem of load balancing in distributed stream processing engines, which is exacerbated in the presence of skew. We introduce Partial Key Grouping (PKG), a new stream…