IVF Equi-join Vector Query¶
A Top-K
l2_distanceordering over an inner equi-join, and the equivalentINsubquery membership path, are rewritten to anivf_searchscan over an IVF-FLAT index. The rewrite preserves join multiplicities, distance thresholds,OFFSET, zeroLIMIT, and index-hint contracts;LEFT JOINand non-equi joins are not rewritten.
Description¶
When the table searched by a Top-K vector query is inner-joined to another table on an equality condition, the query shape is:
SELECT a.id
FROM chunks a JOIN documents b ON a.document_id = b.document_id
ORDER BY l2_distance(a.v, '[0,0]')
LIMIT 3;
MatrixOne rewrites this join shape into an IVF-FLAT approximate-nearest-neighbor scan when the searched column carries an IVF-FLAT index — the same ivf_search plan node used for plain vector search. The rewrite applies symmetrically to the equivalent IN-subquery form:
SELECT a.id
FROM chunks a
WHERE a.document_id IN (SELECT document_id FROM documents)
ORDER BY l2_distance(a.v, '[0,0]')
LIMIT 3;
The key property preserved by the rewrite is join multiplicity: the ANN candidate domain only selects approximate neighbor rows, while the final join still produces one result row per matching join partner. Duplicate expansion after the join, distance thresholds (<= and > bounds) combined with ordinary predicates in any order, OFFSET, zero LIMIT, and empty join domains all keep the exact result of the unrewritten plan. WHERE filters that exclude nearest rows do not waste the candidate budget.
The rewrite is subject to these boundaries:
LEFT JOINis not rewritten; the plan stays a normal join.A non-equi join condition (for example
a.document_id < b.document_id) is not rewritten.A nullable vector column is not rewritten directly; adding
a.v IS NOT NULLto the query restores the rewrite.The system variable
probe_limitapplies to the scan,BY RANK WITH OPTION 'mode=pre'keeps the ANN scan, and'mode=force'bypasses it, exactly as in plain IVF vector search.An ordinary secondary index on the joined table can be used both for the eligibility domain and for the multiplicity-preserving final join;
IGNORE INDEXremoves it from both roles.Index hints on the ANN side (
USE INDEX/IGNORE INDEX) constrain the scans but do not disable the ANN rewrite. An explicitFORCE INDEX FOR JOINon the ANN side takes precedence over the rewrite: the plan uses the named B-tree join and noivf_searchnode appears.INT/BIGINTprimary keys follow the same exact-membership protocol as string primary keys; duplicate multiplicities are identical.A prepared statement can bind the
LIMIT; data updates that change join multiplicities are picked up on the nextEXECUTEwithout re-prepare, and aNULLquery-vector parameter keeps the fallback semantics.
Syntax¶
SELECT ... FROM indexed_table AS a
JOIN membership_table AS b ON a.key = b.key
ORDER BY l2_distance(a.vector_column, query_vector)
LIMIT k [OFFSET n];
Arguments¶
a.vector_columnhas an IVF-FLAT index; the query uses an inner equi-join.query_vectorhas the same dimension as the indexed column.kselects Top-K rows after join multiplicity is applied.
Examples¶
All statements below can be run consecutively on a fresh MatrixOne instance:
DROP DATABASE IF EXISTS vector_ivf_equi_join;
CREATE DATABASE vector_ivf_equi_join;
USE vector_ivf_equi_join;
SET @saved_experimental_ivf_index = @@experimental_ivf_index;
SET experimental_ivf_index = 1;
SET probe_limit = 1;
CREATE TABLE chunks (id VARCHAR(32) PRIMARY KEY, v VECF32(2) NOT NULL, document_id VARCHAR(32), category VARCHAR(32));
INSERT INTO chunks VALUES ('c0','[0,0]','u','x'),('c1','[0.01,0]','u','x'),('c2','[0.1,0]','d1','x'),('c3','[0.2,0]','d2','z'),('c4','[0.3,0]','d1','y'),('c5','[0.6,0]','d3','outside'),('c6','[0.15,0]',NULL,'null');
CREATE INDEX chunks_ivf USING IVFFLAT ON chunks(v) LISTS=1 OP_TYPE 'vector_l2_ops';
CREATE TABLE documents (row_id INT PRIMARY KEY, document_id VARCHAR(32), label VARCHAR(32), payload VARCHAR(32));
INSERT INTO documents VALUES (1,'d1','x','first'),(2,'d1','y','second'),(3,'d2','z','third'),(4,'d3','outside','fourth'),(5,NULL,'null','fifth');
CREATE TABLE unique_documents (document_id VARCHAR(32) PRIMARY KEY, label VARCHAR(32));
INSERT INTO unique_documents VALUES ('d1','x'),('d2','z'),('d3','outside');
EXPLAIN shows the ivf_search node for the plain query and for 'mode=pre'; 'mode=force' bypasses the rewrite:
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=pre';
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
The two nearest rows (c0, c1) are not eligible for the join (their document_id 'u' has no match). After the join expands a-rows once per matching b-row, the top three rows are c2,c2,c3 — c2 matches two documents rows with document_id = 'd1' and appears twice:
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=pre';
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
SELECT a.id FROM chunks a WHERE a.document_id IN (SELECT document_id FROM documents) ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN unique_documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.label FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.label,l2_distance(a.v,'[0,0]') AS distance FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY distance LIMIT 3;
SELECT a.id,b.label FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM documents b JOIN chunks a ON b.document_id=a.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.label FROM chunks a JOIN documents b ON a.document_id=b.document_id AND a.category=b.label ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
Distance predicates behave correctly on both bounds. A <= threshold is re-checked on the final join rows; a > threshold prunes before the Top-K so nearby ineligible rows do not exhaust the candidate budget:
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')<=0.15 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 10;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')<=0.15 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 10 BY RANK WITH OPTION 'mode=force';
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')>0.15 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')>0.15 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
A lower bound combined with an ordinary predicate must keep working in either predicate order, instead of truncating to an empty result:
UPDATE chunks SET category='x' WHERE id='c4';
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')>0.15 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')>0.15 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' AND l2_distance(a.v,'[0,0]')>0.15 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')>0.15 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1 BY RANK WITH OPTION 'mode=force';
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')<=0.25 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' AND l2_distance(a.v,'[0,0]')<=0.25 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')<=0.25 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
SELECT a.id FROM chunks a WHERE a.document_id IN (SELECT document_id FROM documents) AND l2_distance(a.v,'[0,0]')>0.15 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1 BY RANK WITH OPTION 'mode=pre';
SELECT a.id FROM chunks a WHERE a.document_id IN (SELECT document_id FROM documents) AND a.category='x' AND l2_distance(a.v,'[0,0]')>0.15 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1 BY RANK WITH OPTION 'mode=pre';
SELECT a.id FROM chunks a WHERE a.document_id IN (SELECT document_id FROM documents) AND l2_distance(a.v,'[0,0]')>0.15 AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 1 BY RANK WITH OPTION 'mode=force';
UPDATE chunks SET category='y' WHERE id='c4';
OFFSET, zero LIMIT, and empty join domains keep unrewritten-plan semantics:
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')<=0.5 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 OFFSET 1;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE l2_distance(a.v,'[0,0]')<=0.5 ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 OFFSET 1 BY RANK WITH OPTION 'mode=force';
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 2 OFFSET 20;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 0;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='absent' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
A prepared statement binds the LIMIT; join multiplicities change with data updates and the next EXECUTE picks them up without re-prepare. A NULL query-vector parameter keeps the fallback semantics instead of becoming an empty eligibility domain:
PREPARE p FROM 'SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,"[0,0]") LIMIT ?';
SET @k=0;
EXECUTE p USING @k;
SET @k=3;
EXECUTE p USING @k;
UPDATE documents SET document_id='u' WHERE document_id='d1';
EXECUTE p USING @k;
UPDATE documents SET document_id='d1' WHERE document_id='u';
EXECUTE p USING @k;
SET @k=0;
EXECUTE p USING @k;
DEALLOCATE PREPARE p;
PREPARE null_vector FROM 'SELECT COUNT(*) FROM (SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,?) LIMIT 3) q';
SET @query_vector=NULL;
EXECUTE null_vector USING @query_vector;
SET @query_vector='[0,0]';
EXECUTE null_vector USING @query_vector;
DEALLOCATE PREPARE null_vector;
A nullable vector column is not rewritten by itself; adding IS NOT NULL to the query restores the rewrite:
CREATE TABLE nullable_chunks (id VARCHAR(32) PRIMARY KEY, v VECF32(2), document_id VARCHAR(32));
INSERT INTO nullable_chunks VALUES ('n0',NULL,'d1'),('n1','[0.1,0]','d1');
CREATE INDEX nullable_ivf USING IVFFLAT ON nullable_chunks(v) LISTS=1 OP_TYPE 'vector_l2_ops';
EXPLAIN SELECT a.id FROM nullable_chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 2;
SELECT a.id FROM nullable_chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 2;
SELECT a.id FROM nullable_chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 2 BY RANK WITH OPTION 'mode=force';
EXPLAIN SELECT a.id FROM nullable_chunks a JOIN documents b ON a.document_id=b.document_id WHERE a.v IS NOT NULL ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM nullable_chunks a JOIN documents b ON a.document_id=b.document_id WHERE a.v IS NOT NULL ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
BIGINT primary keys follow the same membership protocol as string primary keys:
CREATE TABLE int_chunks (id BIGINT PRIMARY KEY, v VECF32(2) NOT NULL, document_id VARCHAR(32));
INSERT INTO int_chunks VALUES (1,'[0,0]','u'),(2,'[0.1,0]','d1'),(3,'[0.2,0]','d2');
CREATE INDEX int_ivf USING IVFFLAT ON int_chunks(v) LISTS=1 OP_TYPE 'vector_l2_ops';
EXPLAIN SELECT a.id FROM int_chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM int_chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM int_chunks a JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
An empty right side answers with the ordinary empty join; LEFT JOIN and non-equi join conditions are not rewritten (no ivf_search node):
CREATE TABLE empty_documents (document_id VARCHAR(32));
SELECT a.id FROM chunks a JOIN empty_documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM chunks a LEFT JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id<b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
An ordinary secondary index on the joined table serves both the eligibility domain and the multiplicity-preserving final join; IGNORE INDEX drops it from both. Hints on the ANN side constrain the scans without disabling the rewrite:
INSERT INTO documents VALUES (6,'d1','x','duplicate');
CREATE INDEX idx_label_document ON documents(label,document_id);
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
SELECT a.id,b.document_id FROM documents b JOIN chunks a ON b.document_id=a.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.document_id FROM documents b JOIN chunks a ON b.document_id=a.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
SELECT a.id,b.payload FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 4;
SELECT a.id,b.payload FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 4 BY RANK WITH OPTION 'mode=force';
EXPLAIN SELECT a.id FROM chunks a JOIN documents b IGNORE INDEX(idx_label_document) ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b IGNORE INDEX(idx_label_document) ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
Hints on the ANN side (USE INDEX/IGNORE INDEX) constrain the filtering and membership scans and still keep the ivf_search node, in both join orders. FORCE INDEX FOR JOIN keeps correct column binding and duplicate expansion:
CREATE INDEX idx_category_document ON chunks(category,document_id);
EXPLAIN SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM chunks a IGNORE INDEX(idx_category_document) JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM chunks a USE INDEX(chunks_ivf) JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM documents b JOIN chunks a IGNORE INDEX(idx_category_document) ON b.document_id=a.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id FROM chunks a IGNORE INDEX(idx_category_document) WHERE a.document_id IN (SELECT document_id FROM documents) AND a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a IGNORE INDEX(idx_category_document) JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a USE INDEX(chunks_ivf) JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
EXPLAIN SELECT a.id FROM chunks a IGNORE INDEX FOR JOIN(idx_category_document) JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM chunks a FORCE INDEX FOR JOIN(idx_category_document) JOIN documents b ON a.document_id=b.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id FROM documents b JOIN chunks a FORCE INDEX FOR JOIN(idx_category_document) ON b.document_id=a.document_id WHERE a.category='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
An explicit FORCE INDEX FOR JOIN on the ANN-side join access takes precedence over the optional ANN scan: the plan uses the named B-tree index and no ivf_search node appears, in both join orders and under 'mode=pre':
CREATE INDEX idx_document ON chunks(document_id);
CREATE INDEX idx_document ON documents(document_id);
EXPLAIN SELECT a.id,b.label FROM chunks a JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id,b.label FROM chunks a FORCE INDEX FOR JOIN(idx_document) JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id,b.label FROM chunks a FORCE INDEX FOR JOIN(idx_document) JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=pre';
EXPLAIN SELECT a.id,b.label FROM documents b JOIN chunks a FORCE INDEX FOR JOIN(idx_document) ON b.document_id=a.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
EXPLAIN SELECT a.id,b.label FROM documents b FORCE INDEX FOR JOIN(idx_document) JOIN chunks a ON b.document_id=a.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.label FROM chunks a FORCE INDEX FOR JOIN(idx_document) JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.label FROM chunks a FORCE INDEX FOR JOIN(idx_document) JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=pre';
SELECT a.id,b.label FROM chunks a FORCE INDEX FOR JOIN(idx_document) JOIN documents b ON a.document_id=b.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3 BY RANK WITH OPTION 'mode=force';
SELECT a.id,b.label FROM documents b FORCE INDEX FOR JOIN(idx_document) JOIN chunks a ON b.document_id=a.document_id WHERE b.label='x' ORDER BY l2_distance(a.v,'[0,0]') LIMIT 3;
SELECT a.id,b.label FROM chunks a FORCE INDEX FOR JOIN(idx_document) JOIN documents b ON a.document_id=b.document_id ORDER BY l2_distance(a.v,'[0,0]') LIMIT 2 OFFSET 1;
SET experimental_ivf_index=@saved_experimental_ivf_index;
DROP DATABASE vector_ivf_equi_join;