Compression match enumeration
US9065469B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Jul 19, 2013 |
| Grant date | Jun 23, 2015 |
| Priority date | — |
| Expiry date | Jul 19, 2033 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/3086
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
Abstract
In embodiments of compression match enumeration, a trie structure can be searched to enumerate data sequence matches after the trie structure is generated. The trie structure can be generated by overwriting a suffix array of data sequences stored in a memory buffer, where the suffix array includes an array of buffer positions sorted alphabetically by a data string that begins a data sequence at a respective buffer position. The trie structure can then be traversed to determine the data sequence matches from nodes in the trie structure. The trie structure can also be updated while being traversed to bypass multiple enumerations of the data sequence matches that have the same match length.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.