Chenguang Fang

Chenguang Fang

Auto-generated profile, based on publicly available information

Chenguang Fang

OceanBase, Ant Group, Hangzhou, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2023 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
CFChenguang Fang
Chenguang Fang
SSShaoxu Song
Shaoxu Song
HGHaoquan Guan
Haoquan Guan
XHXiangdong Huang
Xiangdong Huang
CWChen Wang
Chen Wang
JWJianmin Wang
Jianmin Wang
Columnar storage is now an industry standard design in most open-source or commercial time series database products, making them HTAP systems. The time column of a time series serves as the key for identifying the other value column, namely single-column storage scheme. When multiple time series share a similar set of timestamps, very likely in a module of multiple sensors, it is natural to group them together, i.e., one time column identifies multiple value columns in a single-group storage scheme. While multiple value columns sharing the same time column reduce the space cost of repeating timestamps, it may introduce extra space cost for recording null values. The reason is that time series may not be exactly aligned on each timestamp, owing to missing values, distinct data collection frequencies, unsynchronized clocks and so on. The columngroups storage scheme is thus to divide columns into multiple groups, within which the value columns share the same time column. Unfortunately, the problem of finding the optimal column groups for the minimum space cost is highly challenging, NP-hard according to our analysis. Thereby, we propose a heuristic algorithm for automatically grouping time series for efficient columnar storage. The column groups storage has been deployed in Apache IoTDB, an open-source time series database. The extensive performance analysis, over real-world data from our industrial partners, demonstrates that the proposed column groups achieve near optimal storage, more concise than the storage of single-column or single-group schemes. Interestingly, both the flushing and querying time costs of column groups are comparable to those of single-column or singlegroup, i.e., without incurring extra time cost.

22 June 2025
Verified
Conference Paper
Open access
CFChenguang Fang
Chenguang Fang
CQChen Qian
Chen Qian
QYQi Yang
Qi Yang
ZWZeyu Wang
Zeyu Wang
ZYZhenkun Yang
Zhenkun Yang
CYChuanhui Yang
Chuanhui Yang