This protocol can trace an attack back not only in real time using a hash table but also periodically using a Compressed Hash Table (CHT).
In practice, this is done by using a hash table for storing values of Q.
They are also used to construct two vectors X' and Y', each of dimension d', using a hash function h.
We make three specific contributions: (a) we develop an authentication scheme that is both low-cost (using a Merkle hash tree to amortise digital signature costs), and loss-resilient (using network coding to recover strategic nodes within the tree).
The indexing is done using a hashing technique where the hashing function makes use of a region based QuadTree structure.
Where the k-mer hash would be too large for available memories, we sampled the k-mers using a hash-slicing factor S (must be prime).
To improve the algorithm efficiency, a hash tree is constructed for the storage and quick access to all of the candidates.
In this case, it seems to be advantageous to use a hash table as an index structure instead of a suffix tree, as proposed by the authors of GDC.
Singh [35] tries to use a hash table, hash trie and hash table trie for candidate storage in Apriori MapReduce-based implementation.
For the fingerprint, the subgraph is converted to a number using a tree-hashing algorithm that consecutively removes leaves until only the ring remains; the ring is then hashed in its lexically minimal rotation.
