发明申请
- 专利标题: EFFICIENT STRING HASH COMPUTATION
- 专利标题(中): 有效的STRING HASH计算
-
申请号: US13543010申请日: 2012-07-06
-
公开(公告)号: US20140009314A1公开(公告)日: 2014-01-09
- 发明人: Peter D. Bain , Peter W. Burka , Charles R. Gracie
- 申请人: Peter D. Bain , Peter W. Burka , Charles R. Gracie
- 申请人地址: US NY Armonk
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY Armonk
- 主分类号: H03M7/34
- IPC分类号: H03M7/34
摘要:
A method for efficiently computing a hash value for a string is disclosed. In one embodiment, such a method includes receiving an original string comprising multiple characters. The method computes an original hash value for the original string. The method produces an updated string by performing at least one of the following updates on the original string: adding leading/trailing characters to the original string; removing leading/trailing characters from the original string, and modifying characters of the original string while preserving the length of the original string. The method then computes an updated hash value for the updated string by performing at least one operation on the original hash value, wherein the at least one operation takes into account the updates that were made to the original string. A corresponding apparatus and computer program product are also disclosed.
信息查询
IPC分类: