Haixiang Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Haixiang Li has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Anqun Pan
Tencent Inc., Shenzhen, China
5 shared publications - Wei Lu
Renmin University of China
4 shared publications - Xiaoyong Du
Renmin University of China
4 shared publications - Hongyao Zhao
The Key Laboratory of Data Engineering and Knowledge Engineering, Ministry of Education, China, and School of Information, Renmin University of China, Beijing, China
2 shared publications - Meihui Zhang
Beijing Institute of Technology
2 shared publications - Chenyang Zhang
Tsinghua University, Beijing, China
1 shared publication
Latest Publications
- 14 December 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 33 (2) , 543-567
RCBench: an RDMA-enabled transaction framework for analyzing concurrency control algorithms
- 14 December 2023
- Published by Springer Nature in The VLDB Journal
- Vol. 33 (2) , 543-567
RCBench: an RDMA-enabled transaction framework for analyzing concurrency control algorithms
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (5) , 1902-1918
Compressed Data Direct Computing for Databases
Directly performing operations on compressed data has been proven to be a big success facing big data problems in modern data management systems. These systems have demonstrated significant compression benefits and performance improvement for data analytics applications. However, current systems only focus on data queries, while a complete big data system must support both data query and data manipulation. To solve this problem, we develop CompressDB, which is a new storage engine that can support data processing for databases without decompression. CompressDB has the following advantages. First, CompressDB utilizes context-free grammar to compress data, and supports both data query and data manipulation. Second, for adaptability, we integrate CompressDB to file systems so that a wide range of databases can directly use CompressDB without any change. Third, we enable operation pushdown to storage so that we can perform data query and manipulation in storage systems without bringing large data to memory for high efficiency. We validate the efficacy of CompressDB supporting various kinds of database systems, including SQLite, MySQL, LevelDB, MongoDB, ClickHouse, and Neo4j. We evaluate our method using seven real-world datasets with various lengths, structures, and content in both single node and cluster environments. Experiments show that CompressDB achieves 40% throughput improvement and 44% latency reduction, along with 1.75 compression ratio on average.
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (5) , 1902-1918
Compressed Data Direct Computing for Databases
Directly performing operations on compressed data has been proven to be a big success facing big data problems in modern data management systems. These systems have demonstrated significant compression benefits and performance improvement for data analytics applications. However, current systems only focus on data queries, while a complete big data system must support both data query and data manipulation. To solve this problem, we develop CompressDB, which is a new storage engine that can support data processing for databases without decompression. CompressDB has the following advantages. First, CompressDB utilizes context-free grammar to compress data, and supports both data query and data manipulation. Second, for adaptability, we integrate CompressDB to file systems so that a wide range of databases can directly use CompressDB without any change. Third, we enable operation pushdown to storage so that we can perform data query and manipulation in storage systems without bringing large data to memory for high efficiency. We validate the efficacy of CompressDB supporting various kinds of database systems, including SQLite, MySQL, LevelDB, MongoDB, ClickHouse, and Neo4j. We evaluate our method using seven real-world datasets with various lengths, structures, and content in both single node and cluster environments. Experiments show that CompressDB achieves 40% throughput improvement and 44% latency reduction, along with 1.75 compression ratio on average.
- 31 July 2023
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 38 (4) , 927-946
Context-Aware Semantic Type Identification for Relational Attributes
- 31 July 2023
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 38 (4) , 927-946
Context-Aware Semantic Type Identification for Relational Attributes
- 31 January 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (1) , 128-146
Checking Causal Consistency of MongoDB
- 31 January 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (1) , 128-146
Checking Causal Consistency of MongoDB
- 19 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
T-SQL: A Lightweight Implementation to Enable Built-in Temporal Support in MVCC-based RDBMSs
The adoption of temporal expressions into SQL:2011 has continuously driven the extensions of temporal support in relational database systems (a.b.a. RDBMSs). In this paper, we present T-SQL, a lightweight yet efficient built-in temporal implementation in RDBMSs. T-SQL completely relies on multi-version concurrency control (MVCC) which is widely adopted in RDMBSs to manage temporal data. For temporal data, current records are maintained in legacy databases, and historical records, i.e., previoius versions of current records (if any), which used to be periodically reclaimed are separately maintained in KV stores. To enable temporal query processing under SQL:2011, we extend the query engine in legacy RDBMSs to support query processing over either historical records or current records or both. Further, regarding temporal data are ever-increasing, we propose various optimizations to reduce the storage overhead of KV stores while keeping efficient query performance. We elaborate on a publicly available implementation, on how to integrate T-SQL into both centralized and distributed RDBMSs. We conduct extensive experiments on both YCSB and TPC-series benchmarks by comparing T-SQL with other temporal database systems. The results show that T-SQL is both lightweight and efficient.
- 19 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
T-SQL: A Lightweight Implementation to Enable Built-in Temporal Support in MVCC-based RDBMSs
The adoption of temporal expressions into SQL:2011 has continuously driven the extensions of temporal support in relational database systems (a.b.a. RDBMSs). In this paper, we present T-SQL, a lightweight yet efficient built-in temporal implementation in RDBMSs. T-SQL completely relies on multi-version concurrency control (MVCC) which is widely adopted in RDMBSs to manage temporal data. For temporal data, current records are maintained in legacy databases, and historical records, i.e., previoius versions of current records (if any), which used to be periodically reclaimed are separately maintained in KV stores. To enable temporal query processing under SQL:2011, we extend the query engine in legacy RDBMSs to support query processing over either historical records or current records or both. Further, regarding temporal data are ever-increasing, we propose various optimizations to reduce the storage overhead of KV stores while keeping efficient query performance. We elaborate on a publicly available implementation, on how to integrate T-SQL into both centralized and distributed RDBMSs. We conduct extensive experiments on both YCSB and TPC-series benchmarks by comparing T-SQL with other temporal database systems. The results show that T-SQL is both lightweight and efficient.