Jiasong Sun

An Efficient Merged Concurrency Control Method for Concurrency Conflicts

Traditional distributed transaction protocol typically included two-phase locking (2PL) or optimistic concurrency control (OCC). However, both of them have the problems when more concurrency conflicts existed in the conditions for large amount requirements of data and processing. In this paper, we propose one merged concurrency control method in the distributed single transaction to support for conflicts more efficiently. TPC-C experiments and results implied that our merged distributed transaction has better ability to handle concurrency conflicts, especially in the case of many conflicts. It can read, write and recall operations with fully utilizing temporal redundancy and data network and be suitable for large-scale data and computationally intensive projects.

Data Dissemination and Parallel Processing Techniques Research Based on Massively Parallel Processing

In the current distributed database system architecture enterprise-class, the massively parallel processing architecture is used frequently. This method can be used to carry out large-scale analysis of data through distributed across multiple nodes and storage and query process, from its scope of application produce simple reports to perform complex analytics workloads. However, due to the characteristics of shared-nothing MPP technology, to carry out large-scale data analysis query and maintain data consistency there are some difficulties. In this paper, a relational SQL-based query parsing distributed MPP data distribution and parallel processing technology, the goal is to maintain and improve the consistency of distributed data query speed. First SQL query analysis section, according to the syntax analysis, semantic analysis and sentence parsing steps such order; in the form of work distribution node/data node in the data distribution phase, all tasks emanating from the work of a distribution node, all need to treated results are returned to the node; when parallel processing, each node needs to store a copy of the lookup table, and on each node concurrent execution of SQL statements for each query. Experimental results show that the proposed MPP data distribution and parallel processing scheme can support large volume of data processing, ensuring data consistency in the premise of improving query processing speed.

An efficient transaction processing method on the distributed database

Distributed system have shown its good robustness, extensibility and effectiveness in the processing, storage and transmission of large data. Now with the expansion of the amount of data and application, it has become a challenging task to ensure its transaction in a distributed and heterogeneous environment. The sub transactions of a distributed transaction not only need to be coordinated with the local other transactions, but also with other sub transactions that generated in the global manager. Based on the discussion of distributed transaction processing model and its transaction commit protocol, the failure reasons with the model analysis of general distributed transaction processing in the practical application in our information database system are given, based on the interface in a relational database management system and super text pre-treatment language of distributed transaction processing implementation method. The research results show that this distributed transaction processing method is reliable, and can simplify the implementation of global program.

Hybrid Redundancy Fault Tolerant Codec in Distributed Storage System

Reed-Solomon erasure codes is the most widely used multi-binary codes which could correct the random errors and unexpected errors. Its characteristics include: It has the strongest capability to correct random errors and burst errors under the same coding redundancy and larger coding gain under the same coding efficiency, Secondly, it is close to the limit in the case of short codes and medium codes and it can greatly improve the performance of the error correction when it is combined with the data interleaving technology, Finally, it has strict algebraic structure which is shown as the linear cyclic polynomials. This paper develops a new merge approach of nonlinear self-repairing code and Reed-Solomon codes. When the network condition is good, Reed-Solomon erasure codes is adopted, and in poor network conditions, nonlinear self-repairing codes is used. The efficiency of maintaining redundant data is improved by a few of damaged information. The experiments show that this method can reduce the amount of network transmission data, at the same time it can shorten the amount data of recovery operation and reconstruction time.