Summary: Pull Request resolved: https://github.com/facebookresearch/faiss/pull/4250 This is an attempt to re-land the diff stack D69972250 D70982449 It was reverted because the bottom of the stack did not pass the tests. The original code comes from Alexandr Guzhva's https://github.com/facebookresearch/faiss/pull/4199 To the adsmarket steward: the diff was already accepted by your team (see D70982449), but reverted for an independent reason. So should be easy to accept now. Reviewed By: mengdilin Differential Revision: D71614511 fbshipit-source-id: 94139b4a4d457afe0d37ac95342537414aa81e7a |
||
---|---|---|
.. | ||
offline_ivf | ||
rocksdb_ivf | ||
CMakeLists.txt | ||
README.md | ||
demo_auto_tune.py | ||
demo_client_server_ivf.py | ||
demo_distributed_kmeans_torch.py | ||
demo_imi_flat.cpp | ||
demo_imi_pq.cpp | ||
demo_ivfpq_indexing.cpp | ||
demo_nndescent.cpp | ||
demo_ondisk_ivf.py | ||
demo_qinco.py | ||
demo_residual_quantizer.cpp | ||
demo_sift1M.cpp | ||
demo_weighted_kmeans.cpp | ||
index_pq_flat_separate_codes_from_codebook.py |
README.md
Demos for a few Faiss functionalities
demo_auto_tune.py
Demonstrates the auto-tuning functionality of Faiss
demo_ondisk_ivf.py
Shows how to construct a Faiss index that stores the inverted file data on disk, eg. when it does not fit in RAM. The script works on a small dataset (sift1M) for demonstration and proceeds in stages:
0: train on the dataset
1-4: build 4 indexes, each containing 1/4 of the dataset. This can be done in parallel on several machines
5: merge the 4 indexes into one that is written directly to disk (needs not to fit in RAM)
6: load and test the index