Jiahuan Shen

dblp:250/7533 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0003-1836-9770ORCID · reported

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

Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 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 · 100%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query execution
batch query processing
0.812024
WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications · Proc. ACM Manag. Data 2024
Query processing and optimization
database access optimization
0.212024
WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications · Proc. ACM Manag. Data 2024

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

speculative execution · 1.5program analysis · 1.5concolic execution · 1.5
YearPublicationVenuePosition
2026 DIndex: an Efficient on-Disk Learned Index for Memory-Constrained Environments
Jiahuan Shen, Chuzhe Tang, Haoning Lan
ICDE1
2024 WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications
abstract
Modern web applications use databases to store their data. When processing user requests, these applications retrieve and store data in the database server, which incurs network round trips. These round trips significantly increase the application's latency. Previous approaches have attempted to reduce these round trips by prefetching query results or batching database accesses. However, neither method can efficiently reduce the latency when some queries depend on previous queries' results. In real-world applications, nearly 50% of the queries depend on the result of other queries. This paper presents WeBridge, the first system capable of synthesizing stored procedures for large-scale real-world web applications. First, WeBridge employs concolic execution technique to analyze the applications and generate stored procedures for hot program paths. Then, it seamlessly integrates the stored procedures into the application by extending the database access library. Finally, it improves the efficiency of the stored procedures with speculative execution. Evaluation using real-world web applications and workloads show that WeBridge achieves up to 79.8% median latency reduction and up to 2× peak throughput.
Gansen Hu, Chuzhe Tang, Jiahuan Shen, Zhiyuan Dong, Sheng Yao 0006, Haibo Chen 0001
Proc. ACM Manag. Data4