Tieying Zhang
Research Subjects
Tieying Zhang has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Jianjun Chen
Bytedance, San Jose, USA
8 shared publications - Xiao He
ByteDance, Hangzhou, China
7 shared publications - Rui Shi
ByteDance Inc., Beijing, China
4 shared publications - Fengrui Liu
Bytedance, Beijing, China
3 shared publications - Lei Zhang
Bytedance, San Jose, USA
3 shared publications - Zeyan Li
Bytedance, Beijing, China
3 shared publications
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 784-794
Topic-wise Summarization of Support Ticket Dialogue via LLM
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 784-794
Open AccessTopic-wise Summarization of Support Ticket Dialogue via LLM
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1565-1580
Proactive Change Risk Detection in Production Cloud Systems: ByteDance’s Experience
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1565-1580
Open AccessProactive Change Risk Detection in Production Cloud Systems: ByteDance’s Experience
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1225-1237
FoundRoot: Towards Foundation Model for Root Cause Analysis via Structured Deep Thinking
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1225-1237
Open AccessFoundRoot: Towards Foundation Model for Root Cause Analysis via Structured Deep Thinking
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (5) , 1186-1204
Scalable and Efficient Reinforcement Learning for Virtual Machine Rescheduling in Cloud Data Centers
Managing a vast number of virtual machines (VMs) efficiently is a critical challenge in modern large-scale data centers. The continuous creation and termination of VMs lead to resource fragmentation across physical machines (PMs), necessitating periodic VM rescheduling to optimize resource utilization. Despite its significance, VM rescheduling has received limited attention in the literature. A key challenge is that, unlike conventional combinatorial optimization problems, the efficiency of rescheduling algorithms is heavily impacted by inference time, as VM states evolve dynamically during execution. This scalability bottleneck hampers existing methods. To address this, we propose VMR$^{2}$ L, a reinforcement learning framework tailored for VM rescheduling. VMR$^{2}$ L integrates a two-stage decision-making process to accommodate complex operational constraints, a feature extraction mechanism that captures critical relational information for rescheduling, and a risk-aware evaluation strategy that enables users to balance execution speed and rescheduling accuracy. Extensive experiments using real-world data from a production-scale data center demonstrate that VMR$^{2}$ L achieves near-optimal performance while reducing inference time to a matter of seconds.- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 37 (5) , 1186-1204
Scalable and Efficient Reinforcement Learning for Virtual Machine Rescheduling in Cloud Data Centers
Managing a vast number of virtual machines (VMs) efficiently is a critical challenge in modern large-scale data centers. The continuous creation and termination of VMs lead to resource fragmentation across physical machines (PMs), necessitating periodic VM rescheduling to optimize resource utilization. Despite its significance, VM rescheduling has received limited attention in the literature. A key challenge is that, unlike conventional combinatorial optimization problems, the efficiency of rescheduling algorithms is heavily impacted by inference time, as VM states evolve dynamically during execution. This scalability bottleneck hampers existing methods. To address this, we propose VMR$^{2}$ L, a reinforcement learning framework tailored for VM rescheduling. VMR$^{2}$ L integrates a two-stage decision-making process to accommodate complex operational constraints, a feature extraction mechanism that captures critical relational information for rescheduling, and a risk-aware evaluation strategy that enables users to balance execution speed and rescheduling accuracy. Extensive experiments using real-world data from a production-scale data center demonstrate that VMR$^{2}$ L achieves near-optimal performance while reducing inference time to a matter of seconds.- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-29
AgentTune: An Agent-Based Large Language Model Framework for Database Knob Tuning
Database knob tuning is a long-standing challenge in the database community, aimed at enhancing the performance of database management systems (DBMSs) by minimizing latency and maximizing throughput. Manual tuning, which relies heavily on human expertise, is often inefficient and impractical for large-scale or dynamic deployments. Recent work has explored automating this process using machine learning (ML) and large language models (LLMs). However, existing methods typically require hundreds of workload replays or rely on extensive training data, leading to low tuning efficiency or high preparation costs. Moreover, they also risk generating invalid configurations that can degrade performance or even crash the database. To address these limitations, we introduce AgentTune, the first agent-based knob tuning framework powered by LLMs, designed for efficiency, adaptability, and reliability. AgentTune decomposes the tuning process into four specialized agents: Workload Analyzer, Knob Selector, Range Pruner, and Configuration Recommender, each responsible for a distinct subtask. These agents collaborate through structured prompt chaining. AgentTune first analyzes the input workload to identify impactful knobs and reconstructs their valid ranges to reduce the search space. It then employs a tree-based search strategy to efficiently explore the configuration space and identify suitable knob values. We conduct extensive evaluations across diverse workloads (public benchmarks and real-world workloads), metrics (latency and throughput), DBMSs (PostgreSQL, MySQL, and TiDB), hardware environments, and database scales. Experimental results demonstrate that, compared to existing baselines, AgentTune is able to identify superior configurations using significantly fewer workload replays. Furthermore, AgentTune rarely generates invalid configurations during the tuning process, ensuring reliability and suitability for real-world deployments.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-29
Open AccessAgentTune: An Agent-Based Large Language Model Framework for Database Knob Tuning
Database knob tuning is a long-standing challenge in the database community, aimed at enhancing the performance of database management systems (DBMSs) by minimizing latency and maximizing throughput. Manual tuning, which relies heavily on human expertise, is often inefficient and impractical for large-scale or dynamic deployments. Recent work has explored automating this process using machine learning (ML) and large language models (LLMs). However, existing methods typically require hundreds of workload replays or rely on extensive training data, leading to low tuning efficiency or high preparation costs. Moreover, they also risk generating invalid configurations that can degrade performance or even crash the database. To address these limitations, we introduce AgentTune, the first agent-based knob tuning framework powered by LLMs, designed for efficiency, adaptability, and reliability. AgentTune decomposes the tuning process into four specialized agents: Workload Analyzer, Knob Selector, Range Pruner, and Configuration Recommender, each responsible for a distinct subtask. These agents collaborate through structured prompt chaining. AgentTune first analyzes the input workload to identify impactful knobs and reconstructs their valid ranges to reduce the search space. It then employs a tree-based search strategy to efficiently explore the configuration space and identify suitable knob values. We conduct extensive evaluations across diverse workloads (public benchmarks and real-world workloads), metrics (latency and throughput), DBMSs (PostgreSQL, MySQL, and TiDB), hardware environments, and database scales. Experimental results demonstrate that, compared to existing baselines, AgentTune is able to identify superior configurations using significantly fewer workload replays. Furthermore, AgentTune rarely generates invalid configurations during the tuning process, ensuring reliability and suitability for real-world deployments.
- Open Access
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 343-354
TickIt: Leveraging Large Language Models for Automated Ticket Escalation
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 343-354
Open AccessTickIt: Leveraging Large Language Models for Automated Ticket Escalation
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Reproducibility Report for ACM SIGMOD 2025 Paper: 'PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models'
We successfully reproduced the key performance results that presented in Tables~3 and~4 of the original paper. The authors provided a GitHub repository. https://github.com/bytedance/plm4ndv that includes the implementation, detailed build and execution instructions, and links to the datasets used in the experiments. We appreciate the authors' assistance with environment setup and debugging.
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessReproducibility Report for ACM SIGMOD 2025 Paper: 'PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models'
We successfully reproduced the key performance results that presented in Tables~3 and~4 of the original paper. The authors provided a GitHub repository. https://github.com/bytedance/plm4ndv that includes the implementation, detailed build and execution instructions, and links to the datasets used in the experiments. We appreciate the authors' assistance with environment setup and debugging.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 471-484
ABase: the Multi-Tenant NoSQL Serverless Database for Diverse and Dynamic Workloads in Large-scale Cloud Environments
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 471-484
Open AccessABase: the Multi-Tenant NoSQL Serverless Database for Diverse and Dynamic Workloads in Large-scale Cloud Environments
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 512-524
Adaptive and Efficient Log Parsing as a Cloud Service
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 512-524
Open AccessAdaptive and Efficient Log Parsing as a Cloud Service
- Open Access
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-28
PLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models
Number of Distinct Values (NDV) estimation of a multiset/column is a basis for many data management tasks, especially within databases. Despite decades of research, most existing methods require either a significant amount of samples through uniform random sampling or access to the entire column to produce estimates, leading to substantial data access costs and potentially ineffective estimations in scenarios with limited data access. In this paper, we propose leveraging semantic information, i.e., schema, to address these challenges. The schema contains rich semantic information that can benefit the NDV estimation. To this end, we propose PLM4NDV, a learned method incorporating Pre-trained Language Models (PLMs) to extract semantic schema information for NDV estimation. Specifically, PLM4NDV leverages the semantics of the target column and the corresponding table to gain a comprehensive understanding of the column's meaning. By using the semantics, PLM4NDV reduces data access costs, provides accurate NDV estimation, and can even operate effectively without any data access. Extensive experiments on a large-scale real-world dataset demonstrate the superiority of PLM4NDV over baseline methods. Our code is available at https://github.com/bytedance/plm4ndv.
- 17 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (3) , 1-28
Open AccessPLM4NDV: Minimizing Data Access for Number of Distinct Values Estimation with Pre-trained Language Models
Number of Distinct Values (NDV) estimation of a multiset/column is a basis for many data management tasks, especially within databases. Despite decades of research, most existing methods require either a significant amount of samples through uniform random sampling or access to the entire column to produce estimates, leading to substantial data access costs and potentially ineffective estimations in scenarios with limited data access. In this paper, we propose leveraging semantic information, i.e., schema, to address these challenges. The schema contains rich semantic information that can benefit the NDV estimation. To this end, we propose PLM4NDV, a learned method incorporating Pre-trained Language Models (PLMs) to extract semantic schema information for NDV estimation. Specifically, PLM4NDV leverages the semantics of the target column and the corresponding table to gain a comprehensive understanding of the column's meaning. By using the semantics, PLM4NDV reduces data access costs, provides accurate NDV estimation, and can even operate effectively without any data access. Extensive experiments on a large-scale real-world dataset demonstrate the superiority of PLM4NDV over baseline methods. Our code is available at https://github.com/bytedance/plm4ndv.