Hi Evgeny,
you may look at http://www.panFMP.org
This software uses a similar approach for very fast range queries without
modifying Lucene. It works by storing the double values in a special encoded
form with different precisions in the index, similar to the well known
TRIEs.
It may be very inte
Quadtrees and R-trees have been used as special "domain" indexes in Oracle
RDBMS for Spatial:
http://www.oracle.com/technology/products/spatial/htdocs/data_sheet_9i/9iR2_spatial_ds.html
Some lectures and papers:
http://csiweb.ucd.ie/staff/mbertolotto/home/lecture-notes4025-07-08.htm
http://ieeex
Great work, Evgeny!
I'm certainly interested in this area and will be dissecting this in
some detail.
I've done similar work before but making use of JTS (Java Topology
Suite), using the OpenGIS standards for spatial features/queries and
2-pass spatial queries (first rough pass is MBB only,
Hello,
As part of my MSc project this summer I developed geoLucene, a
modified version of Lucene (based on 2.3-dev checked out on 05.07)
that can index geographical data using R-trees. It has been shown to
be faster on geographic queries than the unmodified Lucene. The code
is hosted at https://so
