Hi.
I'm looking at the SDB indexes for the Nodes table,
and I got a very naive question.
There is a hash based Nodes table,
where there is no ID column, and the primary key of the table is the hash.
What happens if two of the lex-values by some insane coincidence get the
same hash?
Is there a built-in handling for this case, or is the hash-function somehow
specified to be unique? or is there actually a slight possibility of just
getting sdb-errors ("non-unique primary key" or something like that) when
using that version?
--
Cheers,
Henrik Kjus Alstad
