T
Ty
Hi all
we have a situation where we have a very big datatable with more than
one unique key. lookup using the primary key is very fast (with
table.rows.find). but if i want to lookup rows with other columns,
wich happen to be unique too, (with table.select), it's about 10 times
slower.
is it possible to use additional unique constraint for similarly fast
lookup as if it where a primary key? any other suggestion?
thanks!
(to circumvent the problem i made a class wich creates a hashtable
with the additinal key pointing to the primary key. it's fast but
cumbersome since i have to keep the hashtable up-to-date manually)
we have a situation where we have a very big datatable with more than
one unique key. lookup using the primary key is very fast (with
table.rows.find). but if i want to lookup rows with other columns,
wich happen to be unique too, (with table.select), it's about 10 times
slower.
is it possible to use additional unique constraint for similarly fast
lookup as if it where a primary key? any other suggestion?
thanks!
(to circumvent the problem i made a class wich creates a hashtable
with the additinal key pointing to the primary key. it's fast but
cumbersome since i have to keep the hashtable up-to-date manually)