A parallel suffix sorting method and system
A sorting method and suffix technology, applied in the field of data processing, can solve the problems that the computer cannot exert full performance and the running speed of the serial IS algorithm is low, and achieve the effect of high speedup ratio, increased running speed and high parallelism.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0039] Such as figure 1 As shown, a parallel suffix sorting method includes the following steps:
[0040] Step S101: find out the LMS substring in the character string X, the specific implementation is as follows:
[0041] (1) The last element of the string X is an additional "$", which is the smallest character in the string. Define X[i]X[i+1], then suffix(X,i) is L type; when X [i]=X[i+1], then suffix(X,i) is of the same type as suffix(X,i+1). Use the L / S suffix recognizer to scan the string X from right to left, and store the result in an array t of length n.
[0042] (2) Simultaneously count the size of each bucket and the number of L-type and S-type suffixes of each bucket during the scanning process. Use the array bucket to record the number of occurrences of each character in the string X. Traverse the string X from left to right, and add one to bucket[X[i]] every time a character is traversed. Traverse the bucket array from left to right, set bucket[i] += bucket[...
Embodiment 2
[0063] Such as figure 2 As shown, a parallel suffix sorting system includes a front unit, an analysis unit, and a storage unit; the front unit is used to perform steps S101 to S102; the analysis unit is used to perform steps S103 to S111; The storage unit described above is responsible for storing temporary data generated by multi-thread parallel inductive sorting.
[0064] The front unit includes a decision subunit, an LMS substring calculation subunit and an SA block subunit;
[0065] The decision-making subunit is used to read the string X from the storage unit, use the L / S suffix recognizer to identify the string X, obtain its suffix type array t, count the number of L and S types of each suffix, and Write storage unit; Described LMS substring calculation subunit is used for reading suffix type array t from storage unit, calculates and obtains all LMS characters, then calculates LMS substring position, and writes storage unit; The above SA block subunit is used to divid...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com