Parallel prefix data retrieval method and system based on prefix tree structure
A data retrieval and prefix technology, applied in the field of information retrieval, can solve the problems of difficult maintenance, low efficiency, large amount of data, etc., and achieve the effect of improving efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0031] When the inventor was conducting research on the optimization of the prefix tree algorithm, he found that the matching search algorithm of the traditional prefix tree is very efficient for processing short-length prefixes, and the processing time gradually increases with the increase of the prefix length. Nowadays, with the improvement of CPU performance and the rapid development of parallel computing, the computing power of computers is no longer the bottleneck of system efficiency improvement, and parallel programming has gradually become a very basic and important part of system design. Therefore, the inventor considers applying parallel programming to the algorithm optimization of the prefix tree. For all prefixes, each segment is divided into multiple segments, and the index entry in each segment can be found through the prefix when performing prefix matching, so that parallel search, insertion, and deletion operations can be performed on each segment, so that even ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 

