-
## Tree-based approach
- [Optimised kd-trees for fast image descriptor matching](https://users.cecs.anu.edu.au/~hartley/Papers/PDF/SilpaAnan:CVPR08.pdf)
- [Data structures and algorithms for neare…
-
hi
I am very impressive on the speed of Clickhouse, greet job
Now, I want to add the feature search to clickhouse, search the nearest feature by euclidean distance. Oue feature is 512d float32, …
-
Jira Link: [DB-12030](https://yugabyte.atlassian.net/browse/DB-12030)
### Description
Hi
I understand from the following documentation that our ybdb does not support distributed vector storage. May…
-
### Setup Environment
- Neo4j version: 1.5.9
- Operating system: Windows10
- API/Driver: (for example Cypher)
- Embedding Model - text-embedding-ada-002
I am trying to retrieve data from neo4…
-
Hello,
I am seeing some behavior I can't explain. We have a query which tries to pull relevant documents from a DB given two embeddings per document (and at runtime, we get two embeddings for this …
-
**Description:**
The current implementation of the image similarity search process in the codebase is experiencing significant slowness, impacting overall system performance. When consuming tasks f…
-
-
## Description
For vector search, right now, we benchmark ANN methods that approximate nearest neighbor search. In addition to this, some users want to run exact k-NN search that returns the exact …
-
### Description
It would be nice to support multiple values in a Knn vector field.
This must be compatible with both the Exact and Approximate Nearest Neighbor search.
There are two sides to the …
-
ArangoDB allows vector data types and similarity calculations such as dot product and cosine similarity.
But brute force vector search is slow and requires high resources, to mitigate the problem ANN…