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

Jiani Yang

dblp:277/9869 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 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
2 papers
Database system architecture and tuning · 33% Query processing and optimization · 29% Indexing and storage engines · 19%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
bayesian optimization
0.912025
Twisted Twin: A Collaborative and Competitive Memory Management Approach in HTAP Systems · Proc. VLDB Endow. 2025
Database system architecture and tuning
hybrid transactional and analytical processing
0.912025
Twisted Twin: A Collaborative and Competitive Memory Management Approach in HTAP Systems · Proc. VLDB Endow. 2025
Indexing and storage engines › storage management
memory management
0.912025
Twisted Twin: A Collaborative and Competitive Memory Management Approach in HTAP Systems · Proc. VLDB Endow. 2025
Query processing and optimization
cost model
0.712023
Rethinking Learned Cost Models: Why Start from Scratch? · Proc. ACM Manag. Data 2023
Query processing and optimization › cost model
learned cost model
0.712023
Rethinking Learned Cost Models: Why Start from Scratch? · Proc. ACM Manag. Data 2023

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

bayesian optimization · 0.9fast-learning model · 0.7dynamic search space partitioning · 0.7
YearPublicationVenuePosition
2025 Twisted Twin: A Collaborative and Competitive Memory Management Approach in HTAP Systems
abstract
Many GaussDB customers, particularly small and medium-sized enterprises (SMEs), require high transaction throughput with occasional analytical queries. HTAP systems that deploy both OLTP and OLAP engines on a single server to manage hybrid workloads have become increasingly popular among customers for achieving high cost-efficiency and data freshness. However, co-locating these systems can lead to resource contention, particularly for memory, potentially degrading overall system performance and causing Service-Level Agreements (SLA) violations. To address this issue, we propose T 2 (Twisted Twin), an adaptive memory management approach that dynamically allocates memory between OLTP and OLAP components. This approach ensures OLTP meets SLA while optimizing the efficiency of OLAP query processing. However, this is non-trivial, as memory allocation triggers a cascade of effects, including in-memory column selection and data synchronization, both critical in HTAP systems. To overcome these challenges, we introduce a Bayesian optimization framework tailored for fluctuating workloads that adjusts memory allocation responsively. Experiments conducted on the real-world HTAP system, GaussDB-HTAP, demonstrate the effectiveness and efficiency of T 2 .
Jiani Yang, Sai Wu, Dongxiang Zhang, Xiu Tang, Gang Chen 0001
Proc. VLDB Endow.1
2023 Rethinking Learned Cost Models: Why Start from Scratch?
abstract
Recent work has applied learning-based approaches to replace the conventional cost model, but these approaches are expensive to train and result in high inference overheads. Furthermore, due to a lack of explainability, models trained for one database may not be easily transferred to another, requiring a complete re-training process. In this paper, we propose a new approach to tuning the conventional formula-based cost model for DBMS. Our approach involves identifying important parameters within the cost model rules and using a fast-learning model to adjust them for each specific hardware and software configuration of the DBMS deployment. We dynamically partition the search space of hardware and software configurations to gradually refine the cost model estimation. To apply our cost model to a new DBMS instance, we start with a rough estimation and progressively refine it with finer granularity. Our experiments with different hardware and software configurations show that our approach enables the conventional cost model to be quickly transferred to any database instance, achieving comparable results to a fine-tuned learning-based model. Overall, our approach provides a practical solution to tuning the conventional cost model for DBMS, with significant benefits in terms of reduced cost and improved performance.
Jiani Yang, Sai Wu, Dongxiang Zhang, Feifei Li 0001, Gang Chen 0001
Proc. ACM Manag. Data1
2022 Modelling EMG driven wrist movements using a bio-inspired neural network
Yinfeng Fang, Jiani Yang, Dalin Zhou, Zhaojie Ju
Neurocomputing2