luoxiaojian

5 ms·

1.
by luoxiaojian 20d ago
The access pattern - byte ranges of columns - suits io_uring well. All the problems are because of poor engineering.
2.
by luoxiaojian 7mo ago
If you're interested in query performance on object storage, we're working on a buffer pool–based I/O mode that will leverage io_uring and object storage SDKs to improve cold-read performance. The trade-off is that in fully w
3.
by luoxiaojian 7mo ago
Author here. Thanks for putting Zvec through its paces and sharing such detailed results—really appreciate the hands-on testing! Just a bit of context on the storage behavior: Zvec currently uses memory-mapped files (mmap) by default, so on
4.
by luoxiaojian 8mo ago
Will do—pgvector is on our list for the blog post.
5.
by luoxiaojian 8mo ago
Appreciate the thoughtful breakdown—you're absolutely right that quantization, dimensionality, and threading all play a big role in performance numbers. Thanks for the kind words and for engaging in the discussion. Wishing you a happy
6.
by luoxiaojian 8mo ago
You're right that we didn't include sqlite-vec in our initial benchmarks—apples-to-apples comparisons are always better. I've actually added basic zvec tests to my fork of sqlite-vec ( https://github.com/luoxia
7.
by luoxiaojian 8mo ago
You're absolutely right—sqlite-vec currently only supports brute-force search, and its latency does scale linearly with dataset size. We did some rough comparisons using its benchmark tools: on the SIFT dataset, latency was around 100m
8.
by luoxiaojian 8mo ago
Author here. Thanks for sharing—always great to see different approaches in the space. A quick note on QPS: throughput numbers alone can be misleading without context on recall, dataset size, distribution, hardware, distance metric, and oth
9.
by luoxiaojian 8mo ago
Author here. Appreciate the context—just wanted to add some perspective on the 8K QPS figure: in the VectorDBBench setting we used (10M, 768d, on comparable hardware to the previous leader), we're seeing double their throughput—so it&#
10.
by luoxiaojian 8mo ago
Author here. Good point—OpenSearch (which is based on FAISS) is actually included in the VectorDBBench results, so you can see how it compares there. That said, horizontal scaling for vector search is relatively straightforward; the real c
11.
by luoxiaojian 8mo ago
Author here. Thanks everyone for the interest and thoughtful questions! I've noticed many of you are curious about how we achieved the performance numbers and how we compare to other solutions. We're currently working on a detaile
12.
by luoxiaojian 8mo ago
Author here. Thanks for the interest! On the performance side: we've applied optimizations like prefetching, SIMD, and a novel batch distance computation (similar to a GEMV operation) that alone gives ~20% speedup. We're working o