in reply to Heap structure for lookup?
I'd look at using a B-tree for this type of problem, lookups are efficient once the tree is created. Balancing the tree when adding or removing elements can be somewhat expensive, but b-trees don't need to be balancing as frequently as binary trees so it's not too bad. Many databases use b-trees -- but you seem to be ruling those out for some reason ;)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Heap structure for lookup?
by BrowserUk (Patriarch) on May 27, 2015 at 09:49 UTC | |
by RichardK (Parson) on May 27, 2015 at 10:26 UTC | |
by BrowserUk (Patriarch) on May 27, 2015 at 13:06 UTC |