File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -6,9 +6,6 @@ Embeddings4j is an in-memory vector database optimized for storage and efficient
66- You want to store your data in separate persistent storage and use an in-memory DB as an index for fast lookup.
77- You want to use it for integration testing.
88
9- ## Requirements
10- - Java 8 or later.
11-
129## Current State:
1310- Implemented using HNSW.
1411- Uses cosine distance for similarity search.
@@ -28,6 +25,9 @@ Embeddings4j is an in-memory vector database optimized for storage and efficient
2825- Consider reducing dimensionality of vectors (to save memory and speed up storage/search).
2926- Please let us know what you need.
3027
28+ ## Requirements
29+ - Java 8 or later.
30+
3131## Start Using
3232Maven:
3333```
@@ -71,4 +71,4 @@ List<SearchNearestResult<Float>> results = db.execute(query);
7171assertThat(results).hasSize(maxResults);
7272assertThat(results.get(0).embedding()).isEqualTo(embedding1);
7373assertThat(results.get(1).embedding()).isEqualTo(embedding2);
74- ```
74+ ```
You can’t perform that action at this time.
0 commit comments