Calvin Sun

dblp:276/5028 · DBLP profile ↗
← Back
5ranked-venue papers in the field
0as first author
4since 2021 · last 2023
0009-0008-8521-9170ORCID · corroborated

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 4Information Retrieval & Web Search · 1
YearPublicationVenuePosition
2023 dbET: Execution Time Distribution-based Plan Selection
abstract
While selecting the execution plan for a given query based on a single estimated cost is a generally-adopted strategy, it is usually error-prone and fails to comprehensively profile the plan performance. In this work, we complement existing plan selection methods by proposing a new approach named ET, which produces execution time distributions for query plans utilizing conformal predictions. We develop dbET, a framework that integrates ET into an existing DBMS, requiring no modification to the DBMS and only incurring minor overhead to query processing. Based on the execution time distribution, we design several intuitive yet fundamental query execution objectives and devise the corresponding plan selection strategies. Our experiments on several widely-adopted benchmarks showcase that our design significantly improves the capability of DBMSs in achieving the designated objectives.
Yifan Li 0006, Xiaohui Yu 0001, Nick Koudas, Calvin Sun
Proc. ACM Manag. Data5
2023 Taurus MM: bringing multi-master to the cloud
abstract
A single-master database has limited update capacity because a single node handles all updates. A multi-master database potentially has higher update capacity because the load is spread across multiple nodes. However, the need to coordinate updates and ensure durability can generate high network traffic. Reducing network load is particularly important in a cloud environment where the network infrastructure is shared among thousands of tenants. In this paper, we present Taurus MM, a shared-storage multi-master database optimized for cloud environments. It implements two novel algorithms aimed at reducing network traffic plus a number of additional optimizations. The first algorithm is a new type of distributed clock that combines the small size of Lamport clocks with the effective support of distributed snapshots of vector clocks. The second algorithm is a new hybrid page and row locking protocol that significantly reduces the number of lock requests sent over the network. Experimental results on a cluster with up to eight masters demonstrate superior performance compared to Aurora multi-master and CockroachDB.
Alex Depoutovitch, Per-Åke Larson, Jack Ng, Guanzhu Xiong, Paul Lee, Emad Boctor, Samiao Ren, Lengdong Wu, Calvin Sun
Proc. VLDB Endow.12
2022 Integrating the Orca Optimizer into MySQL
Arunprasad P. Marathe, Kareem El Gebaly, Per-Åke Larson, Calvin Sun
EDBT6
2022 Near Data Processing in Taurus Database
abstract
Huawei's cloud-native database system GaussDB for MySQL (also known as Taurus) stores data in a separate storage layer consisting of a pool of storage servers. Each server has considerable compute power making it possible to push data reduction operations (selection, projection, and aggregation) close to storage. This paper describes the design and implementation of near data processing (NDP) in Taurus. NDP has several benefits: it reduces the amount of data shipped over the network; frees up CPU capacity in the compute layer; and reduces query run time, thereby enabling higher system throughput. Experiments with the TPC-H benchmark (100 GB) showed that 18 out of 22 queries benefited from NDP; data shipped was reduced by 63%; and CPU time by 50%. On Q15 the impact was even higher: data shipped was reduced by 98%; CPU time by 91%; and run time by 80%.
Arunprasad P. Marathe, Per-Åke Larson, Calvin Sun, Paul Lee, Juncai Meng, Roulin Lin, Qingping Zhu
ICDE5
2020 Multi-Model Data Query Languages and Processing Paradigms
abstract
Specifying users' interests with a formal query language is a typically challenging task, which becomes even harder in the context of multi-model data management because we have to deal with data variety. It usually lacks a unified schema to help the users issuing their queries, or has an incomplete schema as data come from disparate sources. Multi-Model DataBases (MMDBs) have emerged as a promising approach for dealing with this task as they are capable of accommodating and querying the multi-model data in a single system. This tutorial aims to offer a comprehensive presentation of a wide range of query languages for MMDBs and to make comparisons of their properties from multiple perspectives. We will discuss the essence of cross-model query processing and provide insights on the research challenges and directions for future work. The tutorial will also offer the participants hands-on experience in applying MMDBs to issue multi-model data queries.
Qingsong Guo, Jiaheng Lu, Chao Zhang 0034, Calvin Sun, Steven Yuan
CIKM4