An Efficient Storage Structure and Management for Distributed Ledgers in Blockchain Systems: An Exploration Based on Purely Theoretical Approach

Abstract

In this paper, an efficient data structure for storage, management, and security in blockchain systems is presented. This efficient structure is based on the AVL (Adelson-Velsky and Landis) tree and make an extension for the purpose of management and security. We first present a new storage structure for efficient data search based on the AVL tree. Next we expand this data structure and apply to the management and security of the blockchain ledger. The way of management for distributed account/data is divided into two operations, namely splitting and merging. This paper also makes a discussion about the significance of these two operations. We show a detailed description and make mathematical analysis with proof for the performance of all mechanisms proposed in this paper. In addition, a mechanism of dual authentication is also proposed and to provide a better tamper-proof.