> > Sword seems pretty slow to execute searches. I'm kind of wondering >> how it's indexed. >> >> Unfortunately I don't have a lot of technical expertise on B-trees >> and stuff to optimize searching. ... > > Is any work being done on this? > >Sheepishly (but then aren't we supposed to be sheep) I put up my hand say >"yes". Why so? because I haven't been able to work on it for sometime. > >But my work isn't based on B-trees, which have n log n times. Hashing is >much faster, which are effectively O(1)---and yes it is possible to hash >without either a fixed sized table or without a large prime number.
That just shows how little I know about it :-). On the PDA side, everything is in memory of course. I'm not sure if that is the case with Sword - but it makes sense for sure. I expect I will want to figure out searching on a background thread so results start coming up immediately. But it would be cooL to have searching so fast that it can be interactive - i.e. in iTunes when you start typing an artist, the list gets updated with each character typed. Somewhere in between would be quite nice as well :-). Thanks, - n8 -- Nathan Youngman E-mail: sword at nathany.com Web: http://nathany.com
