| 摘要 |
<p>In embodiments of compression match enumeration, a suffix array can be generated that is representative of data sequences stored in a memory buffer. The suffix array can then be converted into a trie structure that overwrites the suffix array in the memory buffer as the trie structure is generated in-place of the suffix array. The trie structure includes nodes that each represent one or more suffixes of the suffix array, where each consecutive suffix is either grouped with an existing node in the trie structure or added as a new node of the trie structure. Data sequence matches can then be enumerated as determined from the trie structure.</p> |
