Yes, that is the key. I guess pun intended here. You enter one char and the field of possibilities narrows, you enter the second char and the field of possibilities narrows further...Goal being to reach a unique key ...
Sounded to me like all that needs to be indexed is the 1GB or ~128M keys. Actual data storage can be on some HD.
In reply to Re^5: fast disk db with bulk insert, fast read access, compact storage
by Marshall
in thread fast disk db with bulk insert, fast read access, compact storage
by iaw4
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |