Persisting and restoring in-memory neighbor graph vector indexes
AssigneeOracle International Corporation
InventorsAgnivo Saha, Aurosish Mishra, Martin Brugnara, Hao Zhou, Vlad Ioan Haprian, Laurent Phillipe Daynes, Shasank Kisan Chavan
Life of this patent
Estimating the term…
Abstract
Techniques persist and restore in-memory neighbor graph vector indexes that include a vertex identifier to vector mapping and include a neighbor graph of vector neighbor vertices. At least one neighbor graph vector index checkpoint factor can be identified. A determination can be made as to whether to generate a full neighbor graph vector index checkpoint or an incremental neighbor graph vector index checkpoint based on the checkpoint factor.
Claims20
A method comprising:
- storing a neighbor graph vector index, wherein the neighbor graph vector index comprises (1) a vertex ID-vector mapping and (2) a neighbor graph of neighbor vertices for a graph-based approximate nearest neighbor search in a vector database, where each edge in the neighbor graph connects two vertices in a layer of the neighbor graph vector index;
- identifying one or more checkpoint factors;
- and
- based on the one or more checkpoint factors, determining whether to generate a full checkpoint or an incremental checkpoint of the neighbor graph vector index,
- wherein the full checkpoint identifies all vertices in the neighbor graph of the neighbor graph vector index at a particular checkpoint time,
- wherein the incremental checkpoint includes modifications to the neighbor graph vector index at the particular checkpoint time, and
- wherein the modifications to the neighbor graph vector index are modifications that occurred since a previous checkpoint time that is previous to the particular checkpoint time,
- wherein the method is performed by one or more computing devices.
One or more non-transitory storage media storing one or more sequences of instructions which, when executed by one or more computing devices, cause:
- storing a neighbor graph vector index, wherein the neighbor graph vector index comprises (1) a vertex ID-vector mapping and (2) a neighbor graph of neighbor vertices for a graph-based approximate nearest neighbor search in a vector database, where each edge in the neighbor graph connects two vertices in a layer of the neighbor graph vector index;
- identifying one or more checkpoint factors;
- and
- based on the one or more checkpoint factors, determining whether to generate a full checkpoint or an incremental checkpoint of the neighbor graph vector index,
- wherein the full checkpoint identifies all vertices in the neighbor graph of the neighbor graph vector index at a particular checkpoint time,
- wherein the incremental checkpoint includes modifications to the neighbor graph vector index at the particular checkpoint time, and
- wherein the modifications to the neighbor graph vector index are modifications that occurred since a previous checkpoint time that is previous to the particular checkpoint time,
- wherein the method is performed by one or more computing devices.
Dependencies are inferred from the claim text.