Composite Radix Tree-A Storage Method for Efficient Retrieval of Massive Data

The surge of massive data brings difficulties in data storage and data processing for academic researches and applications in plenty of fields. The storage and retrieval of massive data are the important keys for data analysis and data processing. The lack of a suitable data storage solution will lead to a bottleneck in the development of technology based on big data. In the current era, solving the problem of massive data storage and efficient data search is a crucial problem that exists in various fields, and the existing data structures still have many shortcomings in these aspects. In order to innovate and optimize the commonly used data structure—radix tree for data storage, in this paper we design composite radix tree to reduce the data storage space as much as possible while improving the efficiency of massive data retrieval. The composite radix tree data structure provides a new solution for massive data storage and data search.