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.

Congying Wang

dblp:54/8752 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0002-7121-9961ORCID · corroborated

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

Computer networks · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Computer networks
2 papers
Routing and switching · 56% Internet architecture and protocols · 20% Network optimization and economics · 20%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 46% Indexing and storage engines · 46% Transaction processing and concurrency control · 7%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
anycast
1.012026
ReOpt: Near-Optimal Region Division for Low-Latency Regional Anycast · INFOCOM 2026
Routing and switching › routing
anycast routing
1.012026
ReOpt: Near-Optimal Region Division for Low-Latency Regional Anycast · INFOCOM 2026
Network optimization and economics
latency optimization
1.012026
ReOpt: Near-Optimal Region Division for Low-Latency Regional Anycast · INFOCOM 2026
Routing and switching › routing › anycast routing
regional anycast
1.012026
ReOpt: Near-Optimal Region Division for Low-Latency Regional Anycast · INFOCOM 2026
Routing and switching › routing protocol
BGP routing policy
0.912025
AnyTuner: Optimizing IP Anycast Performance via Strategic BGP Routing Policy · ICNP 2025
Indexing and storage engines › tree index
AB-tree
0.712023
Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023
Query processing and optimization
approximate query processing
0.712023
Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023
Indexing and storage engines
concurrent index
0.712023
Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023
Query processing and optimization › approximate query processing
sampling-based approximate query processing
0.712023
Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023
Network measurement and analytics › latency measurement
round-trip time measurement
0.312025
AnyTuner: Optimizing IP Anycast Performance via Strategic BGP Routing Policy · ICNP 2025
Transaction processing and concurrency control › update management
concurrent update
0.212023
Approximate Queries over Concurrent Updates · Proc. VLDB Endow. 2023

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

neural network · 0.9AS-path prepending · 0.9index-assisted sampling · 0.7
YearPublicationVenuePosition
2026 ReOpt: Near-Optimal Region Division for Low-Latency Regional Anycast
Minyuan Zhou, Congying Wang, Jiaqi Zheng 0001, Shuai Hao 0001, Guihai Chen, Jie Wu 0001
INFOCOM3
2025 AnyTuner: Optimizing IP Anycast Performance via Strategic BGP Routing Policy
abstract
Optimizing anycast catchment to ensure clients connect to their expected PoPs remains a significant challenge in production networks, primarily due to BGP’s inherent lack of performance awareness. Existing approaches either lack fine-grained routing policy control or prove operationally impractical. In this paper, we present AnyTuner, an automatic route management system that strategically optimizes anycast performance through AS-path prepending and BGP communities. AnyTuner integrates three key components: a measurement-driven optimization loop, a neural network for PoP traffic matrix prediction, and an automated recommendation engine for configuration generation. Deployed for over two years on a commercial cloud platform, AnyTuner demonstrates remarkable efficacy in our evaluation across 18 PoPs and 9,000+ probes, achieving a 39.9% reduction in median RTT (from 36.3 ms to 21.8 ms) compared to policy-free baseline configurations and outperforming state-of-the-art alternatives like AnyOpt by 27.8%.
Minyuan Zhou, Jiaqi Zheng 0001, Congying Wang, Guihai Chen, Wan-Chun Dou
ICNP3
2023 Approximate Queries over Concurrent Updates
abstract
Approximate Query Processing (AQP) systems produce estimation of query answers using small random samples. It is attractive for the users who are willing to trade accuracy for low query latency. On the other hand, real-world data are often subject to concurrent updates. If the user wants to perform real-time approximate data analysis, the AQP system must support concurrent updates and sampling. Towards that, we recently developed a new concurrent index, AB-tree, to support efficient sampling under updates. In this work, we will demonstrate the feasibility of supporting realtime approximate data analysis in online transaction settings using index-assisted sampling.
Congying Wang, Nithin Sastry Tellapuri, Sphoorthi Keshannagari, Dylan Zinsley, Zhuoyue Zhao 0001, Dong Xie 0001
Proc. VLDB Endow.1