CZChangjian Zhang

Changjian Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Changjian Zhang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:

  • Deyu Qi

    School of Computer Science and Engineering South China University of Technology Guangzhou, China

    2 shared publications
  • Wenhao Huang

    School of Computer Science and Engineering South China University of Technology Guangzhou China

    2 shared publications
  • Wenlin Li

    School of Computer Science and Engineering South China University of Technology Guangzhou China

    2 shared publications
  • Xinyang Wang

    School of Information Science and Technology Beijing Forestry University Beijing China

    2 shared publications
  • Deyu Qi

    Department of Computer Science and Engineering, South China University of Technology, Guangzhou 510000, China

    1 shared publication
  • Jing Guo

    Department of Computer Science and Engineering, South China University of Technology, Guangzhou 510000, China

    1 shared publication

Latest Publications

  • SimpleSync: A parallel delta synchronization method based on Flink

    by Changjian Zhang, Deyu Qi, Wenlin Li, Wenhao Huang, Xinyang Wang

    Cloud storage service has been in full swing in the industry. Delta synchronization technology as a key technology of cloud storage services has not made a key breakthrough. Almost all the existing researches are based on the synchronization process proposed by the Rsync algorithm and mix some optimization appropriately, but the particularity of cloud storage service is not fully considered. This paper proposes a new incremental synchronization method SimpleSync, which makes use of the characteristic that the server does not actively modify the backup files in the cloud storage service, removes the redundant steps in Rsync, and enables the synchronization between the client and the server only through a single communication. Besides, according to the server‐side synchronization request processing logic, this paper puts forward the design idea of parallel processing with the Flink framework, to the best of our knowledge, for the first time. After the server receives the synchronization request, SimpleSync first puts it into Kafka for buffering and then uses Flink to process the synchronization request in parallel. In the experimental part, a large number of experiments are designed to compare SimpleSync with other delta synchronization algorithms. Experimental results show that SimpleSync has obvious advantages in synchronization performance. Meanwhile, experiments show that SimpleSync has correctness.


  • Open Access

    Function of Content Defined Chunking Algorithms in Incremental Synchronization

    by Changjian Zhang, Deyu Qi, Wenlin Li, Jing Guo

    Data chunking algorithms divide data into several small data chunks in a certain way, thus transforming the operation of data into the one of multiple small data chunks. Data chunking algorithms have been widely used in duplicate data detection, parallel computing and other fields, but it is seldom used in data incremental synchronization. Aiming at the characteristics of incremental data synchronization, this paper proposes a novel data chunking algorithm. By dividing two data that need synchronization into small data chunks, comparing the contents of these small data chunks, different ones are the incremental data that need to be found. The new algorithm determines to set a cut-point based on the number of 1 contained in the binary format of all bytes in an interval. Thus it improves the resistance against the byte shifting problem at the expense of the chunk size stability, which makes it more suitable for the incremental data synchronization. Comparing this algorithm with several known classical or state of art algorithms, experiments show that the incremental data found by this algorithm can be reduced by 32%~57% compared to the others with same changes between two data. The experimental results based on real-world datasets show that PCI improves the calculation speed of classic Rsync algorithm up to 70%, however, with a drawback of increasing the Transmission compression rate up to 11.8%.


  • Open Access

    MII: A Novel Content Defined Chunking Algorithm for Finding Incremental Data in Data Synchronization

    by Changjian Zhang, Deyu Qi, Zhe Cai, Wenhao Huang, Xinyang Wang, Wenlin Li, Jing Guo

    In the data backup system, to reduce the bandwidth and processing time overhead caused by full backup technology during data synchronization between backups and source data, incremental backup technology is emerging as the focus of academic and industrial research. It is key but poorly-solved to find the incremental data between backups and source data for incremental backup technology. To find out the incremental data during backup process, here we propose a novel content-defined chunking algorithm. The source data and backup data are chunked into some small chunks in the same way with variable length. Then, by comparing whether a chunk of source data is different from any of the chunks in backup data, we can evaluate whether the chunk of source data is incremental data. By experiments, the chunking algorithm in this paper is compared to other ones which are the classical or state of art algorithms. The experimental results show that the incremental data found by this algorithm can be reduced by 13%~34% compared to the others with the same chunk throughput.