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

Yide Fang

dblp:356/2856 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · unresolved

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

Databases, 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
Database system architecture and tuning · 87% Machine learning and data management · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › configuration tuning
automatic parameter tuning
0.712023
Towards General and Efficient Online Tuning for Spark · Proc. VLDB Endow. 2023
Database system architecture and tuning › database tuning
online tuning
0.712023
Towards General and Efficient Online Tuning for Spark · Proc. VLDB Endow. 2023
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.712023
Towards General and Efficient Online Tuning for Spark · Proc. VLDB Endow. 2023

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

meta-learning · 1.3bayesian optimization · 1.3approximate gradient descent · 1.3adaptive sub-space generation · 1.3
YearPublicationVenuePosition
2023 Towards General and Efficient Online Tuning for Spark
abstract
The distributed data analytic system - Spark is a common choice for processing massive volumes of heterogeneous data, while it is challenging to tune its parameters to achieve high performance. Recent studies try to employ auto-tuning techniques to solve this problem but suffer from three issues: limited functionality, high overhead, and inefficient search. In this paper, we present a general and efficient Spark tuning framework that can deal with the three issues simultaneously. First, we introduce a generalized tuning formulation, which can support multiple tuning goals and constraints conveniently, and a Bayesian optimization (BO) based solution to solve this generalized optimization problem. Second, to avoid high overhead from additional offline evaluations in existing methods, we propose to tune parameters along with the actual periodic executions of each job (i.e., online evaluations). To ensure safety during online job executions, we design a safe configuration acquisition method that models the safe region. Finally, three innovative techniques are leveraged to further accelerate the search process: adaptive sub-space generation, approximate gradient descent, and meta-learning method. We have implemented this framework as an independent cloud service, and applied it to the data platform in Tencent. The empirical results on both public benchmarks and large-scale production tasks demonstrate its superiority in terms of practicality, generality, and efficiency. Notably, this service saves an average of 57.00% memory cost and 34.93% CPU cost on 25K in-production tasks within 20 iterations, respectively.
Yang Li 0106, Huaijun Jiang, Yu Shen 0003, Yide Fang, Danqing Huang, Xinyi Zhang 0002, Wentao Zhang 0001, Ce Zhang 0001, Peng Chen 0021, Bin Cui 0001
Proc. VLDB Endow.4