Update dependency tensorchord/VectorChord to v1

[renovate]

This PR contains the following updates:

Package	Update	Change
tensorchord/VectorChord	major	0.5.3 → 1.1.1

---

Release Notes

tensorchord/VectorChord (tensorchord/VectorChord)

v1.1.1

Compare Source

VectorChord 1.1.1 Release Notes

Features

Added 4 new functions:

• dequantize_to_vector(rabitq8)
• dequantize_to_halfvec(rabitq8)
• dequantize_to_vector(rabitq4)
• dequantize_to_halfvec(rabitq4)

These functions convert quantized vectors back into floating-point vectors.

See Quantization Types for docs.

What's Changed

Replaced the quantization algorithm used by:

• quantize_to_rabitq8(vector)
• quantize_to_rabitq8(halfvec)
• quantize_to_rabitq4(vector)
• quantize_to_rabitq4(halfvec)

with a faster implementation for improved performance.

Full Changelog: supervc-stack/VectorChord@1.1.0...1.1.1

v1.1.0

Compare Source

VectorChord 1.1.0 Release Notes

Features

VectorChord now provides rabitq8 and rabitq4 types. They are RaBitQ-quantized vectors, internally stored as uint8[] or uint4[] instead of float32[] or float16[], costing less storage. Like other vector types, you can create indexes for them.

CREATE TABLE items (id bigserial PRIMARY KEY, embedding rabitq8(3));
CREATE INDEX ON items USING vchordrq (embedding rabitq8_l2_ops);
INSERT INTO items (embedding) VALUES (quantize_to_rabitq8('[0,0,0]'::vector));
INSERT INTO items (embedding) VALUES (quantize_to_rabitq8('[1,1,1]'::vector));
INSERT INTO items (embedding) VALUES (quantize_to_rabitq8('[2,2,2]'::vector));
--- ...
SELECT id FROM items ORDER BY embedding <-> quantize_to_rabitq8('[0.9,0.9,1.1]'::vector) LIMIT 100;

See Quantization Types for docs.

Search parameters could be configured via index storage parameters since 1.1.0. Search parameters can be bound to the index, so they don't need to be specified in a session or transaction.

CREATE INDEX items_embedding_idx ON items USING vchordrq (embedding vector_l2_ops) WITH (options = $$
build.internal.lists = [1000]
$$, probes = '10');

See Fallback Parameters for docs.

What's Changed

PostgreSQL 13 is now end-of-life and will no longer receive security and bug fixes. VectorChord drops PostgreSQL 13 support as of 1.1.0.

Full Changelog: supervc-stack/VectorChord@1.0.0...1.1.0

v1.0.0

Compare Source

VectorChord 1.0 Release Notes

VectorChord 1.0 is here. This release delivers much faster PostgreSQL index builds with IVF + RaBitQ, quicker updates, broader architecture support, and a stack of new features since our first release. It’s a major milestone—production-ready and thoroughly tested.

Highlights

We have dramatically optimized index build speed, now capable of building a 100M-vector dataset in 20 minutes on a 16-vCPU machine while sharply cutting memory usage, making index construction in production far more convenient.

What's changed since 0.5

Performance & scalability

• Lock-contention optimizations in index building
• Faster table sampling in index building
• Hierarchical K-means
• Dimension reduction in K-means
• Parallel compacting in index building
• Prints estimated memory usage in index building

Fixes

• Don't use expensive Rayon fold/reduce
• Freespace recycle in vchordg

Full Changelog: supervc-stack/VectorChord@0.5.3...1.0.0

---

Configuration

📅 Schedule: (UTC)

• Branch creation
  • At any time (no schedule defined)
• Automerge
  • At any time (no schedule defined)

🚦 Automerge: Disabled by config. Please merge this manually once you are satisfied.

♻ Rebasing: Whenever PR becomes conflicted, or you tick the rebase/retry checkbox.

🔕 Ignore: Close this PR and you won't be reminded about this update again.

---

• If you want to rebase/retry this PR, check this box

---

This PR was generated by Mend Renovate. View the repository job log.

[renovate]

Edited/Blocked Notification

Renovate will not automatically rebase this PR, because it does not recognize the last commit author and assumes somebody else may have edited the PR.

You can manually request rebase by checking the rebase/retry box above.

⚠️ Warning: custom changes will be lost.