The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 27, 2016

Filed:

Mar. 01, 2012
Applicants:

H. Jonathan Chao, Holmdel, NJ (US);

Yang Xu, Brooklyn, NY (US);

Inventors:

H. Jonathan Chao, Holmdel, NJ (US);

Yang Xu, Brooklyn, NY (US);

Assignee:

New York University, New York, NY (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 17/30 (2006.01); H04L 29/06 (2006.01); G06F 21/55 (2013.01);
U.S. Cl.
CPC ...
H04L 63/1416 (2013.01); G06F 17/30946 (2013.01); G06F 17/30949 (2013.01); G06F 17/30958 (2013.01); G06F 17/30985 (2013.01); G06F 21/55 (2013.01); H04L 63/0245 (2013.01);
Abstract

A multi-dimensional perfect hash table construction technique is based on which the well-known AC automaton, and can be implemented by very compact perfect hash tables. The technique may place transitions, each from a source state to a destination state, of an automaton into a hash table to generate a perfect hash table by: (a) dividing the transitions into multiple independent sets according to their respective source states; (b) ordering the sets of transitions based on the number of transitions belonging to the set, thereby defining an order of the sets from largest to smallest; and (c) constructing a perfect hash table by, for each of the sets of transitions, in the order from largest to smallest, hashing the transitions of the set into the hashing table to generate a perfect hashing table.


Find Patent Forward Citations

Loading…