Qiang Zhou

Qiang Zhou

Auto-generated profile, based on publicly available information

Qiang Zhou

Ant Group, Hangzhou, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 June 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
ZPZhenxuan Pan
Zhenxuan Pan
TWTao Wu
Tao Wu
QZQingwen Zhao
Qingwen Zhao
QZQiang Zhou
Qiang Zhou
ZPZhiwei Peng
Zhiwei Peng
XZXiaowei Zhu
Xiaowei Zhu
GeaFlow is a distributed dataflow system optimized for streaming graph processing, and has been widely adopted at Ant Group, serving various scenarios ranging from risk control of financial activities to analytics on social networks and knowledge graphs. It is built on top of a base with full-fledged stateful stream processing capabilities, extended with a series of graph-aware optimizations to address the space explosion and programming complexity issues of conventional join-based approaches. We propose new state backends and streaming operators that facilitate processing on dynamic graph-structured datasets, reducing space consumed by states. We develop a hybrid domain-specific language that embeds Gremlin into SQL, supporting both table and graph abstractions over streaming data. In addition to streaming workloads, GeaFlow is also extensively used for some batch processing jobs. In the largest deployments to date, GeaFlow is able to process tens of millions of events per second and manage hundreds of terabytes of states.

18 May 2026 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
ZZZhijie Zhang
Zhijie Zhang
SYSitao Yang
Sitao Yang
WZWeiguo Zheng
Weiguo Zheng
QZQiang Zhou
Qiang Zhou
CHChuntao Hong
Chuntao Hong
Subgraph matching, a fundamental operation in graph analytics, delivers all occurrences of a query pattern within a large data graph. Graph systems often require processing large batches of such queries simultaneously. The existing multi-query approaches typically aim to optimize this process by exploiting the maximum common subgraph (MCS) among query graphs. However, identifying MCS is computationally prohibitive and does not necessarily maximize computational reuse, leading to substantial redundancy and limited scalability. In this paper, we propose MASC, a novel framework for subgraph matching with M ulti-query A cceleration via S hared C omputation. We introduce signature-based joint filtering that enables shared computation in the filtering phase, significantly improving filtering efficiency across queries. Building on this, we propose the visit-once paradigm that leverages shared candidates rather than just shared structure size, ensuring each shared candidate in the data graph is processed only once and further maximizing computation sharing. To further enhance sharing, we develop the shared block reuse that exploits multiple overlapping substructures among queries. Compared to existing methods that leverage only a single overlap, the shared computations are further substantially increased. We conducted extensive experiments on real-world datasets across various domains. The results demonstrate that MASC achieves significant improvements, achieving substantial speedup over state-of-the-art methods, with up to two orders of magnitude improvement.