In the previous blog about consistency, we have explained what the connotation of consistency in a distributed vector database is, covered the four levels of consistency – strong, bounded staleness, session, and eventually supported in the Milvus vector database, and explained the best-suited application scenario of each consistency level.

To offer a quick recap, consistency in a distributed database specifically refers to the property that ensures every node or replica has the same view of data when writing or reading data at a given time. Therefore, the word consistency we talk about in this blog stands for the letter “C” in the CAP theorem.