I see that a properly constructed index is going to be vital for optimum performance. Given the criteria of the dual crossreferenced lookups, how might I better construct the indices in the code I posted? I'm curious to see if the DB solution can be better optimized.
Dave
In reply to Re^4: Hash lookups, Database lookups, and Scalability
by davido
in thread Hash lookups, Database lookups, and Scalability
by davido
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |