|
20 | 20 | import io.github.jbellis.jvector.disk.OnDiskGraphIndex;
|
21 | 21 | import io.github.jbellis.jvector.disk.SimpleMappedReader;
|
22 | 22 | import io.github.jbellis.jvector.example.util.DataSet;
|
23 |
| -import io.github.jbellis.jvector.example.util.DataSetCreator; |
24 | 23 | import io.github.jbellis.jvector.example.util.DownloadHelper;
|
25 | 24 | import io.github.jbellis.jvector.example.util.Hdf5Loader;
|
26 | 25 | import io.github.jbellis.jvector.example.util.ReaderSupplierFactory;
|
@@ -191,12 +190,14 @@ private static ResultSummary performQueries(DataSet ds, RandomAccessVectorValues
|
191 | 190 | public static void main(String[] args) throws IOException {
|
192 | 191 | System.out.println("Heap space available is " + Runtime.getRuntime().maxMemory());
|
193 | 192 |
|
194 |
| - var mGrid = List.of(16); |
195 |
| - var efConstructionGrid = List.of(100); |
196 |
| - var efSearchGrid = List.of(1, 2, 3); |
| 193 | + var mGrid = List.of(16); // List.of(8, 12, 16, 24, 32, 48, 64); |
| 194 | + var efConstructionGrid = List.of(100); // List.of(60, 80, 100, 120, 160, 200, 400, 600, 800); |
| 195 | + var efSearchGrid = List.of(1, 2); |
197 | 196 | List<Function<DataSet, VectorCompressor<?>>> compressionGrid = Arrays.asList(
|
198 | 197 | null, // uncompressed
|
199 |
| - ds -> ProductQuantization.compute(ds.getBaseRavv(), ds.getDimension(), ds.similarityFunction == VectorSimilarityFunction.EUCLIDEAN)); |
| 198 | + ds -> BinaryQuantization.compute(ds.getBaseRavv()), |
| 199 | + ds -> ProductQuantization.compute(ds.getBaseRavv(), ds.getDimension() / 4, ds.similarityFunction == VectorSimilarityFunction.EUCLIDEAN), |
| 200 | + ds -> ProductQuantization.compute(ds.getBaseRavv(), ds.getDimension() / 8, ds.similarityFunction == VectorSimilarityFunction.EUCLIDEAN)); |
200 | 201 |
|
201 | 202 | // var grid2d = DataSetCreator.create2DGrid(4_000_000, 10_000, 100);
|
202 | 203 | // gridSearch(grid2d, compressionGrid, mGrid, efConstructionGrid, efSearchGrid);
|
|
0 commit comments