This means (binary) trees generally are out question, correct?
Certainly any CPAN modules that store generic perl scalars. A custom implementation that stored just a U64 value; giving 24 * 150e6 ~ 3.5GB would be possible.
But it's the need for 2 64-bit pointers that is the main problem, hence my mind drifting to heaps. They self order as you insert, and avoid the pointers.
But are any of the variations O(logN) searchable?
is there any structure on your values that might be leveraged? Or are they more or less random 64bit integers?
No. They can take on any of the 2^64 values and are likely to be distributed right across the range.
In reply to Re^4: Heap structure for lookup?
by BrowserUk
in thread Heap structure for lookup?
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |