Qingwen Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qingwen Zhao has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Bo Li
College of Arts, Business, Law, Education, and Information Technology, Victoria University, Melbourne, VIC, Australia
1 shared publication - Guangtao Xue
Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Guanyu Feng
ZHIPU AI, Beijing, China
1 shared publication - Hongzi Zhu
Shanghai Jiao Tong University
1 shared publication - Jian Cao
College of Management, Zhejiang University of Technology, Hangzhou 310023, China
1 shared publication - Jiefeng Li
Ant Group, Hangzhou, China
1 shared publication
Latest Publications
- Open Access
- 13 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (2) , 1-27
GeaFlow: A Graph Extended and Accelerated Dataflow System
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.
- 13 June 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (2) , 1-27
Open AccessGeaFlow: A Graph Extended and Accelerated Dataflow System
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.
- Open Access
- 24 February 2017
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 60 (6) , 850-865
Fair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones
With the proliferation of smartphones, participatory sensing using smartphones provides unprecedented opportunities for collecting enormous sensing data. There are two crucial requirements in participatory sensing, fair task allocation and energy efficiency, which are particularly challenging given high combinatorial complexity, trade-off between energy efficiency and fairness, and dynamic and unpredictable task arrivals. In this paper, we present a novel fair energy-efficient allocation framework whose objective is characterized by min–max aggregate sensing time. We rigorously prove that optimizing the min–max aggregate sensing time is NP hard even when the tasks are assumed as a priori. We consider two allocation models: offline allocation and online allocation. For the offline allocation model, we design an efficient approximation algorithm with the approximation ratio of , where m is the number of member smartphones in the system. For the online allocation model, we propose two algorithms: greedy algorithm and Robin-Hood algorithm, which achieve the competitive ratio of at most m and , respectively. The results demonstrate that the approximation algorithm reduces over 81% total sensing time, the online greedy algorithm and Robin-Hood algorithms reduce the total sensing time 73% and 37.5%, respectively. The offline approximation algorithm and online greedy algorithm achieve much better min–max fairness compared to other algorithms.- 24 February 2017
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 60 (6) , 850-865
Open AccessFair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones
With the proliferation of smartphones, participatory sensing using smartphones provides unprecedented opportunities for collecting enormous sensing data. There are two crucial requirements in participatory sensing, fair task allocation and energy efficiency, which are particularly challenging given high combinatorial complexity, trade-off between energy efficiency and fairness, and dynamic and unpredictable task arrivals. In this paper, we present a novel fair energy-efficient allocation framework whose objective is characterized by min–max aggregate sensing time. We rigorously prove that optimizing the min–max aggregate sensing time is NP hard even when the tasks are assumed as a priori. We consider two allocation models: offline allocation and online allocation. For the offline allocation model, we design an efficient approximation algorithm with the approximation ratio of , where m is the number of member smartphones in the system. For the online allocation model, we propose two algorithms: greedy algorithm and Robin-Hood algorithm, which achieve the competitive ratio of at most m and , respectively. The results demonstrate that the approximation algorithm reduces over 81% total sensing time, the online greedy algorithm and Robin-Hood algorithms reduce the total sensing time 73% and 37.5%, respectively. The offline approximation algorithm and online greedy algorithm achieve much better min–max fairness compared to other algorithms.