Demo Data from EDBT 2026 / reviewers in the wild / expert
Pengyuan Xu
dblp:131/9518
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
big data querying |
1.0 | 1 | 2026 | Age-Aware Big Data Query Evaluation for Analytic Services in Serverless Edge Clouds · IEEE Trans. Serv. Comput. 2026 |
Internet of things and sensor networks
query processing |
1.0 | 1 | 2026 | Age-Aware Big Data Query Evaluation for Analytic Services in Serverless Edge Clouds · IEEE Trans. Serv. Comput. 2026 |
Cloud and datacenter computing › serverless computing
function-as-a-service |
1.0 | 1 | 2026 | Age-Aware Big Data Query Evaluation for Analytic Services in Serverless Edge Clouds · IEEE Trans. Serv. Comput. 2026 |
Cloud and datacenter computing
serverless computing |
1.0 | 1 | 2026 | Age-Aware Big Data Query Evaluation for Analytic Services in Serverless Edge Clouds · IEEE Trans. Serv. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
online learning · 3.0approximation algorithm · 3.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Age-Aware Big Data Query Evaluation for Analytic Services in Serverless Edge CloudsabstractServerless computing are invented to free developers of analytic services from the management of cloud resources. Developers only need to submit their code to a serverless edge cloud (SEC) and the cloud platform matches the submitted code to itsserverless functions, enabled by the paradigm of Function as a Service (FaaS). However, serverless functions usually are short-lived with limited resources. In this paper, we aim to address the challenge of how to fully utilize the short-lived serverless functions to enable continuous analysis of the most freshly-generated big data. We first formulate an optimization problem of age-aware big data query evaluation in an SEC network so that theage of datais minimized, where the age of data is the duration between the generation time of the data and the current time. We then propose approximation algorithms for the age-aware big data query evaluation problem of a single query, by proposing a parameterized virtualization technique that smartly handles the large resource demands of big data queries in short-lived and resource-constraint serverless functions. We further consider the scenario where big data queries arrive into the system one-by-one and their resource demands are uncertain. To this end, we devise an online learning algorithm with bounded regret by leveraging a memory repacking mechanism to improve resource utilization, for the problem of online age-aware big data query evaluation. We evaluate the performance of the proposed algorithms through extensive simulations to testify their performances in large scales. We also validate the effectiveness of the proposed mechanism in a real test-bed built on Kubernetes and OpenWhisk with TPC-DS benchmarks. Experimental results show that the proposed algorithms outperform the state-of-the-arts, by reducing the age of data by$8.82\%$on average. Zichuan Xu, Lin Wang 0093, Qiufen Xia, Weifa Liang, Wenhao Ren, Pengyuan Xu, Hao Li 0080 |
IEEE Trans. Serv. Comput. | 6 |
| 2025 | Metaverse Service Provisioning Empowered by Monitoring and Analytical Digital Twins in MECabstractMetaverse, as the cyberspace against the real world, offers various immersive services enabling users to entertain, learn and work. The digital twin (DT) technology acts as a fundamental enabler of Metaverse services by mapping user devices to DTs and timely analyzing the status of user devices. Mobile edge computing (MEC) significantly improves the QoS of DT-empowered Metaverse services because it can deploy DTs in cloudlets closer to user devices. However, each user device often has a complex structure with multiple interdependent subsystems that frequently communicate. Further, the resources in MEC network are highly distributed and limited. Thus, provisioning DT-empowered Metaverse services in MEC networks faces the challenge of efficiently mapping intertwining subsystems in user devices to DTs, maximizing admitted service requests and resource utilization. In this paper, we first formulate throughput maximization problems for DT-empowered Metaverse services in an MEC network, with the aim to maximize the total data rate of service requests of Metaverse services while meeting resource capacity constraints of the MEC network. We then propose an approximation algorithm with a provable approximation ratio for the problem with a given set of service requests if both monitoring and analytical DTs are consolidated into a single edge server. Otherwise, we devise an efficient heuristic for the problem with monitoring and analytical DTs possibly being placed into different edge servers. We also consider a dynamic throughput maximization problem of Metaverse service provisioning for a given monitoring period, in which service requests arrive into the system dynamically without the knowledge of future arrivals, service resource demands, and service delay requirements, for which we devise an online learning algorithm. We finally evaluate the performance of the proposed algorithms by extensive simulations. Simulation results show that the throughputs of the proposed algorithms outperform their comparison counterparts by at least 50 %. Guangyuan Xu, Zichuan Xu, Qiufen Xia, Bingheng Yan, Pengyuan Xu |
HPCC | 6 |
| 2025 | A Latent Diffusion Model for Molecular Optimization
Dayu Tan, Pengyuan Xu, Chun-Hou Zheng 0001, Yansen Su |
ICIC (28) | 2 |
| 2013 | Modified Collaborative Filtering Algorithm Based on Multivariate Meta-similarity
Pengyuan Xu, Yanzhong Dang |
KSEM | 1 |