for(1..5){ # of those smaller ones for(1..100){ # number of steps i do when iterating through the smal + table for(1..10000){ # number of steps i do when iterating through big t +able //select a row } } }
If so you're not using your db very efficiently. But it's hard to say as you didn't show us you query. Generally if you are able to improve performance using hash, then you can improve performance of SQL query using indexes.
In reply to Re: how do hashes work - complexity question
by zwon
in thread how do hashes work - complexity question
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |