Hi TJ.
If you use a circle query shape, it's O(N), plus it puts all the points in
memory. If you use a rectangle via bbox then I'm not sure but its fast enough
that I wouldn't worry about it. If my understanding is correct on Lucene
TrieRange fields, it's O(Log(N)). If you want fast filtering no matter what
the query shape is, then I suggest Solr 4.0 SpatialRecursivePrefixTreeFieldType
("location_rpt" in the example schema)
~ David Smiley
On Oct 9, 2012, at 5:00 PM, TJ Tong wrote:
> Hi all,
>
> Does anyone know the Solr (lucene)spatial search time complexity, such as
> geofilt on LatLonType fields? Is it logN?
>
> Thanks!
> TJ
>
>
>
> --
> View this message in context:
> http://lucene.472066.n3.nabble.com/Spatial-Search-response-time-complexity-tp4012801.html
> Sent from the Solr - User mailing list archive at Nabble.com.
