[
https://issues.apache.org/jira/browse/SOLR-5170?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13748318#comment-13748318
]
Bill Bell commented on SOLR-5170:
---------------------------------
David,
How many points is the limit when it "adds up"? Does it give an OOM exception?
Or does it just take longer and longer to respond?
In most use cases there is almost no need to cache the geo spatial search
results, since most users are running queries from multiple locations (with GEO
IP) targeting. At least that is our use case. If the corpus of points is high,
is there an approximation that can be use to reduce it and then run the Circle
radius? For example fq={!cache=false cost=10}lat:[X to Y] AND long:[X1 to Y1]
and apply the fq={!geofilt cost=100} or geodist ?
We have found that doing that speeds things up... Wonder if the code could just
do that for us ?
> Spatial multi-value distance sort via DocValues
> -----------------------------------------------
>
> Key: SOLR-5170
> URL: https://issues.apache.org/jira/browse/SOLR-5170
> Project: Solr
> Issue Type: New Feature
> Components: spatial
> Reporter: David Smiley
> Assignee: David Smiley
> Attachments: SOLR-5170_spatial_multi-value_sort_via_docvalues.patch
>
>
> The attached patch implements spatial multi-value distance sorting. In other
> words, a document can have more than one point per field, and using a
> provided function query, it will return the distance to the closest point.
> The data goes into binary DocValues, and as-such it's pretty friendly to
> realtime search requirements, and it only uses 8 bytes per point.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
