[
https://issues.apache.org/jira/browse/SOLR-12890?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16948967#comment-16948967
]
Doug Turnbull edited comment on SOLR-12890 at 10/10/19 10:01 PM:
-----------------------------------------------------------------
[~solrtrey] Yep, agreed!
I think there's fundamental data structure work to do efficient ANN matching,
but people will want a library of scoring functions for common dense vector
operations. I think those functions are the lowest hanging fruit.
was (Author: softwaredoug):
Yep, agreed!
I think there's fundamental data structure work to do efficient ANN approach
matching, but people will want a library of scoring functions for common dense
vector operations. I think that's the lowest hanging fruit
> Vector Search in Solr (Umbrella Issue)
> --------------------------------------
>
> Key: SOLR-12890
> URL: https://issues.apache.org/jira/browse/SOLR-12890
> Project: Solr
> Issue Type: New Feature
> Reporter: mosh
> Priority: Major
>
> We have recently come across a need to index documents containing vectors
> using solr, and have even worked on a small POC. We used an URP to calculate
> the LSH(we chose to use the superbit algorithm, but the code is designed in a
> way the algorithm picked can be easily chagned), and stored the vector in
> either sparse or dense forms, in a binary field.
> Perhaps an addition of an LSH URP in conjunction with a query parser that
> uses the same properties to calculate LSH(or maybe ktree, or some other
> algorithm all together) should be considered as a Solr feature?
--
This message was sent by Atlassian Jira
(v8.3.4#803005)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
