Andy Ross writes: > Norman wrote: > > [ ... indexing scheme involving spacial partitions and trees ... ] > > > > With such a scheme we should be able to access any airport and > > determine which airports are within some sane distance in much > > less then a few tenths of a second < order of manitude less at least
> My point was that a really simple one-file-per-airport scheme (you > basically can't get any more maintainable than that) would work with > adequate performance for typical usage. My scheme also uses one file per airport PLUS two fairly advanced yet relatively simple indexes for lightning quick seaches. I hope you note that I used a trie which is just a binary implementation of the individual file basd method that you proposed http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/Trie.html And there is a performance issue here with searching radio frequencies for stations within range hence the spatial index for each 10x10 degree block. I believe that my proposal is a 'Dr Pangloss' type solution > * Well, and that it involves a 3rd party C++ library that insists on > installing itself as a shared library % cd $metakit % ../unix/configure --disable-shared % make core % make install best-of-both-worlds'ly yr's Norman _______________________________________________ Flightgear-devel mailing list [EMAIL PROTECTED] http://mail.flightgear.org/mailman/listinfo/flightgear-devel
