Hi,
I read the chapter about custom sort methods and hacked around with
the GeoSort. Are there ways to improve the algorithm? Espacially
calculating the distance for ALL documents in the index is a bad idea
because only the distance for hitted documents are of interest. That
could save lo
15 jul 2008 kl. 09.50 skrev Sascha Fahl:
I read the chapter about custom sort methods and hacked around with
the GeoSort. Are there ways to improve the algorithm? Espacially
calculating the distance for ALL documents in the index is a bad
idea because only the distance for hitted documents
There is a big difference between GeoSearch and GeoSort. GeoSearch
means you are looking for data within a certain range. To implement
this index structures like R-Trees help, because they make it a lot
easier to think in "boxes". GeoSort is just to sort the data in
relation to a given poin
15 jul 2008 kl. 10.20 skrev Sascha Fahl:
There is a big difference between GeoSearch and GeoSort. GeoSearch
means you are looking for data within a certain range. To implement
this index structures like R-Trees help, because they make it a lot
easier to think in "boxes". GeoSort is just to
