2019-07-12 02:14:23 +08:00
|
|
|
|
[role="xpack"]
|
|
|
|
|
[[vector-functions]]
|
|
|
|
|
===== Functions for vector fields
|
|
|
|
|
|
|
|
|
|
NOTE: During vector functions' calculation, all matched documents are
|
2019-10-23 09:06:50 +08:00
|
|
|
|
linearly scanned. Thus, expect the query time grow linearly
|
2019-07-12 02:14:23 +08:00
|
|
|
|
with the number of matched documents. For this reason, we recommend
|
|
|
|
|
to limit the number of matched documents with a `query` parameter.
|
|
|
|
|
|
2021-04-19 20:02:05 +08:00
|
|
|
|
This is the list of available vector functions and vector access methods:
|
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
1. <<vector-functions-cosine,`cosineSimilarity`>> – calculates cosine similarity
|
|
|
|
|
2. <<vector-functions-dot-product,`dotProduct`>> – calculates dot product
|
|
|
|
|
3. <<vector-functions-l1,`l1norm`>> – calculates L^1^ distance
|
|
|
|
|
4. <<vector-functions-l2,`l2norm`>> - calculates L^2^ distance
|
|
|
|
|
5. <<vector-functions-accessing-vectors,`doc[<field>].vectorValue`>> – returns a vector's value as an array of floats
|
|
|
|
|
6. <<vector-functions-accessing-vectors,`doc[<field>].magnitude`>> – returns a vector's magnitude
|
|
|
|
|
|
|
|
|
|
NOTE: The recommended way to access dense vectors is through the
|
|
|
|
|
`cosineSimilarity`, `dotProduct`, `l1norm` or `l2norm` functions. Please note
|
|
|
|
|
however, that you should call these functions only once per script. For example,
|
|
|
|
|
don’t use these functions in a loop to calculate the similarity between a
|
|
|
|
|
document vector and multiple other vectors. If you need that functionality,
|
|
|
|
|
reimplement these functions yourself by
|
|
|
|
|
<<vector-functions-accessing-vectors,accessing vector values directly>>.
|
2021-04-19 20:02:05 +08:00
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
Let's create an index with a `dense_vector` mapping and index a couple
|
2019-07-12 02:14:23 +08:00
|
|
|
|
of documents into it.
|
|
|
|
|
|
2019-09-05 00:51:02 +08:00
|
|
|
|
[source,console]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
--------------------------------------------------
|
2020-07-28 02:46:39 +08:00
|
|
|
|
PUT my-index-000001
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"mappings": {
|
|
|
|
|
"properties": {
|
|
|
|
|
"my_dense_vector": {
|
|
|
|
|
"type": "dense_vector",
|
|
|
|
|
"dims": 3
|
|
|
|
|
},
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"status" : {
|
|
|
|
|
"type" : "keyword"
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2020-07-28 02:46:39 +08:00
|
|
|
|
PUT my-index-000001/_doc/1
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"my_dense_vector": [0.5, 10, 6],
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"status" : "published"
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
|
2020-07-28 02:46:39 +08:00
|
|
|
|
PUT my-index-000001/_doc/2
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"my_dense_vector": [-0.5, 10, 10],
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"status" : "published"
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
|
2020-07-28 02:46:39 +08:00
|
|
|
|
POST my-index-000001/_refresh
|
2019-10-23 09:06:50 +08:00
|
|
|
|
|
2019-07-12 02:14:23 +08:00
|
|
|
|
--------------------------------------------------
|
|
|
|
|
// TESTSETUP
|
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
[[vector-functions-cosine]]
|
|
|
|
|
====== Cosine similarity
|
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
The `cosineSimilarity` function calculates the measure of
|
2019-07-12 02:14:23 +08:00
|
|
|
|
cosine similarity between a given query vector and document vectors.
|
|
|
|
|
|
2019-09-05 00:51:02 +08:00
|
|
|
|
[source,console]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
--------------------------------------------------
|
2020-07-28 02:46:39 +08:00
|
|
|
|
GET my-index-000001/_search
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"query": {
|
|
|
|
|
"script_score": {
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"query" : {
|
|
|
|
|
"bool" : {
|
|
|
|
|
"filter" : {
|
|
|
|
|
"term" : {
|
|
|
|
|
"status" : "published" <1>
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-07-12 02:14:23 +08:00
|
|
|
|
},
|
|
|
|
|
"script": {
|
2019-10-30 04:26:36 +08:00
|
|
|
|
"source": "cosineSimilarity(params.query_vector, 'my_dense_vector') + 1.0", <2>
|
2019-07-12 02:14:23 +08:00
|
|
|
|
"params": {
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"query_vector": [4, 3.4, -0.2] <3>
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
--------------------------------------------------
|
2019-09-05 00:51:02 +08:00
|
|
|
|
|
2019-08-08 21:38:05 +08:00
|
|
|
|
<1> To restrict the number of documents on which script score calculation is applied, provide a filter.
|
|
|
|
|
<2> The script adds 1.0 to the cosine similarity to prevent the score from being negative.
|
|
|
|
|
<3> To take advantage of the script optimizations, provide a query vector as a script parameter.
|
2019-07-12 02:14:23 +08:00
|
|
|
|
|
|
|
|
|
NOTE: If a document's dense vector field has a number of dimensions
|
|
|
|
|
different from the query's vector, an error will be thrown.
|
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
[[vector-functions-dot-product]]
|
|
|
|
|
====== Dot product
|
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
The `dotProduct` function calculates the measure of
|
|
|
|
|
dot product between a given query vector and document vectors.
|
2019-07-12 02:14:23 +08:00
|
|
|
|
|
2019-09-05 00:51:02 +08:00
|
|
|
|
[source,console]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
--------------------------------------------------
|
2020-07-28 02:46:39 +08:00
|
|
|
|
GET my-index-000001/_search
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"query": {
|
|
|
|
|
"script_score": {
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"query" : {
|
|
|
|
|
"bool" : {
|
|
|
|
|
"filter" : {
|
|
|
|
|
"term" : {
|
|
|
|
|
"status" : "published"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-07-12 02:14:23 +08:00
|
|
|
|
},
|
|
|
|
|
"script": {
|
2019-10-23 09:06:50 +08:00
|
|
|
|
"source": """
|
2019-10-30 04:26:36 +08:00
|
|
|
|
double value = dotProduct(params.query_vector, 'my_dense_vector');
|
2019-10-23 09:06:50 +08:00
|
|
|
|
return sigmoid(1, Math.E, -value); <1>
|
|
|
|
|
""",
|
2019-07-12 02:14:23 +08:00
|
|
|
|
"params": {
|
2019-10-23 09:06:50 +08:00
|
|
|
|
"query_vector": [4, 3.4, -0.2]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
--------------------------------------------------
|
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
<1> Using the standard sigmoid function prevents scores from being negative.
|
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
[[vector-functions-l1]]
|
|
|
|
|
====== L^1^ distance (Manhattan distance)
|
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
The `l1norm` function calculates L^1^ distance
|
|
|
|
|
(Manhattan distance) between a given query vector and
|
|
|
|
|
document vectors.
|
2019-07-12 02:14:23 +08:00
|
|
|
|
|
2019-09-05 00:51:02 +08:00
|
|
|
|
[source,console]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
--------------------------------------------------
|
2020-07-28 02:46:39 +08:00
|
|
|
|
GET my-index-000001/_search
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"query": {
|
|
|
|
|
"script_score": {
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"query" : {
|
|
|
|
|
"bool" : {
|
|
|
|
|
"filter" : {
|
|
|
|
|
"term" : {
|
|
|
|
|
"status" : "published"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-07-12 02:14:23 +08:00
|
|
|
|
},
|
|
|
|
|
"script": {
|
2019-10-30 04:26:36 +08:00
|
|
|
|
"source": "1 / (1 + l1norm(params.queryVector, 'my_dense_vector'))", <1>
|
2019-07-12 02:14:23 +08:00
|
|
|
|
"params": {
|
2019-10-23 09:06:50 +08:00
|
|
|
|
"queryVector": [4, 3.4, -0.2]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
--------------------------------------------------
|
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
<1> Unlike `cosineSimilarity` that represent similarity, `l1norm` and
|
|
|
|
|
`l2norm` shown below represent distances or differences. This means, that
|
|
|
|
|
the more similar the vectors are, the lower the scores will be that are
|
|
|
|
|
produced by the `l1norm` and `l2norm` functions.
|
|
|
|
|
Thus, as we need more similar vectors to score higher,
|
|
|
|
|
we reversed the output from `l1norm` and `l2norm`. Also, to avoid
|
|
|
|
|
division by 0 when a document vector matches the query exactly,
|
|
|
|
|
we added `1` in the denominator.
|
2019-07-12 02:14:23 +08:00
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
[[vector-functions-l2]]
|
|
|
|
|
====== L^2^ distance (Euclidean distance)
|
|
|
|
|
|
2019-10-23 09:06:50 +08:00
|
|
|
|
The `l2norm` function calculates L^2^ distance
|
|
|
|
|
(Euclidean distance) between a given query vector and
|
|
|
|
|
document vectors.
|
2019-07-12 02:14:23 +08:00
|
|
|
|
|
2019-09-05 00:51:02 +08:00
|
|
|
|
[source,console]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
--------------------------------------------------
|
2020-07-28 02:46:39 +08:00
|
|
|
|
GET my-index-000001/_search
|
2019-07-12 02:14:23 +08:00
|
|
|
|
{
|
|
|
|
|
"query": {
|
|
|
|
|
"script_score": {
|
2019-08-08 21:38:05 +08:00
|
|
|
|
"query" : {
|
|
|
|
|
"bool" : {
|
|
|
|
|
"filter" : {
|
|
|
|
|
"term" : {
|
|
|
|
|
"status" : "published"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2019-07-12 02:14:23 +08:00
|
|
|
|
},
|
|
|
|
|
"script": {
|
2019-10-30 04:26:36 +08:00
|
|
|
|
"source": "1 / (1 + l2norm(params.queryVector, 'my_dense_vector'))",
|
2019-10-23 09:06:50 +08:00
|
|
|
|
"params": {
|
|
|
|
|
"queryVector": [4, 3.4, -0.2]
|
2019-07-12 02:14:23 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
--------------------------------------------------
|
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
[[vector-functions-missing-values]]
|
|
|
|
|
====== Checking for missing values
|
|
|
|
|
|
|
|
|
|
If a document doesn't have a value for a vector field on which a vector function
|
|
|
|
|
is executed, an error will be thrown.
|
2019-10-23 09:06:50 +08:00
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
You can check if a document has a value for the field `my_vector` with
|
2019-10-23 09:06:50 +08:00
|
|
|
|
`doc['my_vector'].size() == 0`. Your overall script can look like this:
|
|
|
|
|
|
|
|
|
|
[source,js]
|
|
|
|
|
--------------------------------------------------
|
2019-10-30 04:26:36 +08:00
|
|
|
|
"source": "doc['my_vector'].size() == 0 ? 0 : cosineSimilarity(params.queryVector, 'my_vector')"
|
2019-10-23 09:06:50 +08:00
|
|
|
|
--------------------------------------------------
|
|
|
|
|
// NOTCONSOLE
|
2021-04-19 20:02:05 +08:00
|
|
|
|
|
2022-12-12 16:43:46 +08:00
|
|
|
|
[[vector-functions-accessing-vectors]]
|
|
|
|
|
====== Accessing vectors directly
|
|
|
|
|
|
|
|
|
|
You can access vector values directly through the following functions:
|
2021-04-19 20:02:05 +08:00
|
|
|
|
|
|
|
|
|
- `doc[<field>].vectorValue` – returns a vector's value as an array of floats
|
|
|
|
|
|
|
|
|
|
- `doc[<field>].magnitude` – returns a vector's magnitude as a float
|
|
|
|
|
(for vectors created prior to version 7.5 the magnitude is not stored.
|
|
|
|
|
So this function calculates it anew every time it is called).
|
|
|
|
|
|
|
|
|
|
For example, the script below implements a cosine similarity using these
|
|
|
|
|
two functions:
|
|
|
|
|
|
|
|
|
|
[source,console]
|
|
|
|
|
--------------------------------------------------
|
|
|
|
|
GET my-index-000001/_search
|
|
|
|
|
{
|
|
|
|
|
"query": {
|
|
|
|
|
"script_score": {
|
|
|
|
|
"query" : {
|
|
|
|
|
"bool" : {
|
|
|
|
|
"filter" : {
|
|
|
|
|
"term" : {
|
|
|
|
|
"status" : "published"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
},
|
|
|
|
|
"script": {
|
|
|
|
|
"source": """
|
|
|
|
|
float[] v = doc['my_dense_vector'].vectorValue;
|
|
|
|
|
float vm = doc['my_dense_vector'].magnitude;
|
|
|
|
|
float dotProduct = 0;
|
|
|
|
|
for (int i = 0; i < v.length; i++) {
|
|
|
|
|
dotProduct += v[i] * params.queryVector[i];
|
|
|
|
|
}
|
|
|
|
|
return dotProduct / (vm * (float) params.queryVectorMag);
|
|
|
|
|
""",
|
|
|
|
|
"params": {
|
|
|
|
|
"queryVector": [4, 3.4, -0.2],
|
|
|
|
|
"queryVectorMag": 5.25357
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
--------------------------------------------------
|