> >
> > We did it with C++ and a memory mapped file for persistence.
> > We had to use a 64bit cpu and 12G of RAM.
>
> Wow! That's only 300 bytes of RAM for every 10 digit phone number!
We didn't use all of that, last time I checked it was using apx 4G of
RAM,
We had to plan for every possible U
> Christian Fowler wrote:
>
> So it seems Materialized Path is my only option, however I am
> concerned about LIKE performance for the right hand side of
> the tree, where the path is 8digits x 6 levels = 48 chars.
> Should I be concerned? I need split-second real-time
> performance, and can't
