[Lucene-java Wiki] Update of "SpatialSearch" by UweSchindler

[Apache Wiki <wi...@apache.org>]

Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Lucene-java Wiki" for change notification.

The following page has been changed by UweSchindler:
http://wiki.apache.org/lucene-java/SpatialSearch

------------------------------------------------------------------------------
   * http://labs.metacarta.com/blog/27.entry/geographic-queries-on-google-app-engine/
   * http://mappinghacks.com/2008/05/29/geohash-implemented-in-python/
  
- == Simple numerical lat/long search using TrieRangeQuery (contrib/search, version 2.9-dev) ==
+ == Simple numerical lat/long search using NumericRangeQuery (Lucene Core version 2.9-dev) ==
  
- Using Trie''''''Utils, WGS84 latitude and longitude can be efficiently encoded and queried by Trie''''''Utils and Trie''''''Range''''''Query. Use this, if you have a lot of point features that should be queryable using (possibly large) bounding boxes. Trie''''''Range''''''Query is very efficient, when the user searches for bounding boxes of any size and wants to get all included point features (it is even fast, when the user selects large bounding boxes, e.g. -180,-90,180,90 runs in constant time independent of the large range bounds). See: SearchNumericalFields.
+ Using Numeric''''''Field, WGS84 latitude and longitude can be efficiently encoded and queried by Numeric''''''Range''''''Query. Use this, if you have a lot of point features that should be queryable using (possibly large) bounding boxes. Numeric''''''Range''''''Query is very efficient, when the user searches for bounding boxes of any size and wants to get all included point features (it is even fast, when the user selects large bounding boxes, e.g. -180,-90,180,90 runs in constant time independent of the large range bounds). See: SearchNumericalFields.