On Fri, 22 Nov 2002 13:10:54 -0500 Matt Graham <[EMAIL PROTECTED]> wrote:
> >> > Ho do you keep the records sorted in an efficent > >> way? > > > There are a nunber of variations, but I'd bet a linear b-tree node > > handling algorithm would work pretty well. > > Good call with this one. Alessandro, this is definitely the way you want > to go (assuming you don't buy an RDBMS for Palm). And with the way Palm > PDBs work, it would be quite easy. You could easily strip this down to a > Find(), Read(), Write(), Add() interface for the rest of your program. > Wow. Again, nice call, Ben. I'll go for something like that. Thanks to everyone who contributed to this thread, especially Ben! -- Alessandro Zummo, Tower Technologies - Turin, Italy -- For information on using the Palm Developer Forums, or to unsubscribe, please see http://www.palmos.com/dev/support/forums/
