because it's easy to manage 100 or so tables, and handling the hashing (checking uniqueness) will be easier/faster when there's a smaller number of entries in a given tableI do not agree.
Doing some queries over data spread out over 100 tables is way more difficult (and slow) than doing the same query on a single table.
And isn't hashing supposed to be working as fast for large or small addres spaces? The hashing function should be O(1), if I remember well.
CountZero
A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James
In reply to Re^2: Working with large amount of data
by CountZero
in thread Working with large amount of data
by just1fix
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |