Published on *freevec.org* (http://www.freevec.org)

Submitted by markos on Mon, 25/06/2007 - 21:26

Hashing a piece of data is one of the most time consuming process in a a database. Basically, the process builds a unique integer (aka 'hash key') from a series of operations on the objects bytes. Usually these algorithms are not parallelizable, or at least not easily parallelizable, due to the dependency to previous calculations involved. Taking a single family of hashing algorithms, we will provide (with mathematical proof) a second deterministic way of calculating the Nth hash, using easily parallelizable tecniques and also provide the Altivec equivalent of this algorithm.

Tags:

- « first [4]
- ‹ previous [5]
- 1 [4]
- 2 [6]
- 3 [5]
- 4

**Links**

[1] http://www.freevec.org/content/altivec_vectorization_hashing_algorithms

[2] http://www.freevec.org/category/simd/algorithms

[3] http://www.freevec.org/category/simd/algorithms/hashing

[4] http://www.freevec.org/category/simd/architecture/altivec

[5] http://www.freevec.org/category/simd/architecture/altivec?page=2

[6] http://www.freevec.org/category/simd/architecture/altivec?page=1