milvus-logo
LFAI
Home
  • Reference

On-disk Index

This article introduces an on-disk indexing algorithm named DiskANN. Based on Vamana graphs, DiskANN powers efficient searches within large datasets.

To improve query performance, you can specify an index type for each vector field.

Currently, a vector field only supports one index type. Milvus automatically deletes the old index when switching the index type.

Prerequisites

To use DiskANN, note that

  • DiskANN is enabled by default. If you prefer in-memory index over on-disk index, you are advised to disable this feature for a better performance.
    • To disable it, you can change queryNode.enableDisk to false in your milvus configuration file.
    • To enable it again, you can set queryNode.enableDisk to true.
  • The Milvus instance runs on Ubuntu 18.04.6 or a later release.
  • The Milvus data path should be mounted to an NVMe SSD for full performance:
    • For a Milvus Standalone instance, the data path should be /var/lib/milvus/data in the container where the instance runs.
    • For a Milvus Cluster instance, the data path should be /var/lib/milvus/data in the containers where the QueryNodes and IndexNodes run.

Limits

To use DiskANN, ensure that you

  • Use only float vectors with at least 32 dimensions in your data.
  • Use only Euclidean Distance (L2) or Inner Product (IP) to measure the distance between vectors.

Index and search settings

  • Index building parameters

    When building a DiskANN index, use DISKANN as the index type. No index parameters are necessary.

  • Search parameters

    ParameterDescriptionRange
    search_listSize of the candidate list, a larger size offers a higher recall rate with degraded performance.[k, min( 10 * k, 65535)] for k > 20
    [k, 200] for k <= 20

DiskANN is tunable. You can modify DiskANN-related parameters in ${MILVUS_ROOT_PATH}/configs/milvus.yaml to improve its performance.

...
DiskIndex:
  MaxDegree: 56
  SearchListSize: 100
  PQCodeBugetGBRatio: 0.125
  BuildNumThreadsRatio: 1.0
  SearchCacheBudgetGBRatio: 0.125
  LoadNumThreadRatio: 8.0
  BeamWidthRatio: 4.0
...
ParameterDescriptionValue RangeDefault Value
MaxDegreeMaximum degree of the Vamana graph.
A larger value offers a higher recall rate but increases the size of and time to build the index.
[1, 512]56
SearchListSizeSize of the candidate list.
A larger value increases the time spent on building the index but offers a higher recall rate.
Set it to a value smaller than MaxDegree unless you need to reduce the index-building time.
[1, ∞]100
PQCodeBugetGBRatioSize limit on the PQ code.
A larger value offers a higher recall rate but increases memory usage.
(0.0, 0.25]0.125
BuildNumThreadsRatioRatio between the number of threads used to build the index and the number of CPUs.[1.0, 128.0 / CPU number]1.0
SearchCacheBudgetGBRatioRatio of cached node numbers to raw data.
A larger value improves index-building performance with increased memory usage.
[0.0, 0.3)0.10
LoadNumThreadRatioRatio between the number of threads used to load index/search and the number of CPUs. For details, refer to the first item in References and Facts.[1, 65536 / 32 / CPU number]8.0
BeamWidthRatioRatio between the maximum number of IO requests per search iteration and CPU number.[1, max(128 / CPU number, 16)]4.0

Troubleshooting

  • How to deal with the io_setup() failed; returned -11, errno=11:Resource temporarily unavailable error?

    The Linux kernel provides the Asynchronous non-blocking I/O (AIO) feature that allows a process to initiate multiple I/O operations simultaneously without having to wait for any of them to complete. This helps boost performance for applications that can overlap processing and I/O.

    The performance can be tuned using the /proc/sys/fs/aio-max-nr virtual file in the proc file system. The aio-max-nr parameter determines the maximum number of allowable concurrent requests.

    The aio-max-nr defaults to 65535, you can set it up to 10485760.

Try Managed Milvus for Free

Zilliz Cloud is hassle-free, powered by Milvus and 10x faster.

Get Started
Feedback

Was this page helpful?