Methods of creating a dictionary for data compression
AssigneeInternational Business Machines Corporation
InventorsPiotr M. Plachta, Wolfram Sauer, Balakrishna Raghavendra Iyer, Steven Wayne White
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsPiotr M. Plachta, Wolfram Sauer, Balakrishna Raghavendra Iyer, Steven Wayne White
Estimating the term…
Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favors longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.
A method for creating a static dictionary, the method comprising:
A system for creating a static dictionary, comprising:
Dependencies are inferred from the claim text.