Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guanyu Qu

dblp:353/7740 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0005-6305-6217ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 67% Data stream processing · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 77% GPUs and heterogeneous computing · 23%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
collective communication
1.012026
Multipath Collective Communication Beyond Scale-up Networks in GPU Clouds · EuroSys 2026
Query processing and optimization
approximate query processing
0.712023
Hyper-USS: Answering Subset Query Over Multi-Attribute Data Stream · KDD 2023
Data stream processing
sketch
0.712023
Hyper-USS: Answering Subset Query Over Multi-Attribute Data Stream · KDD 2023
Query processing and optimization
subset query
0.712023
Hyper-USS: Answering Subset Query Over Multi-Attribute Data Stream · KDD 2023

Methods — techniques the papers use, named apart from their topics

multipath communication · 1.0joint variance optimization · 0.7
YearPublicationVenuePosition
2026 Multipath Collective Communication Beyond Scale-up Networks in GPU Clouds
Yuchen Xu 0003, Jianglong Nie, Baojia Li 0002, Mingzhuo Chen, Guanyu Qu, Zhenchuan Liu, Shuangshuang Yin, Chunzhi He, Yinben Xia, Xiang Li 0223, Zekun He, Yachen Wang, Xianneng Zou, Congcong Miao, Wenfei Wu
EuroSys6
2023 Hyper-USS: Answering Subset Query Over Multi-Attribute Data Stream
abstract
Sketching algorithms are considered as promising solutions for answering approximate query on massive data stream. In real scenarios, a large number of problems can be abstracted as subset query over multiple attributes. Existing sketches are designed for query on single attributes, and therefore are inefficient for query on multiple attributes. In this work, we propose Hyper-USS, an innovative sketching algorithm that supports subset query over multiple attributes accurately and efficiently. To the best of our knowledge, this work is the first sketching algorithm designed to answer approximate query over multi-attribute data stream. We utilize the key technique, Joint Variance Optimization, to guarantee high estimation accuracy on all attributes. Experiment results show that, compared with the state-of-the-art (SOTA) sketches that support subset query on single attributes, Hyper-USS improves the accuracy by 16.67X and the throughput by 8.54X. The code is open-sourced at Github.
Ruijie Miao, Guanyu Qu, Kaicheng Yang 0001, Tong Yang 0003, Bin Cui 0001
KDD3