US 12,265,531 B2
Lightweight graph database and searchable datastore
Ian Joel De Silva, Minneapolis, MN (US); Blake Killian Wasung, Maple Grove, MN (US); Michael Hughes Neubert, Lakeville, MN (US); Ashlee Janet Suzanne Regan, Chaska, MN (US); and Michael John Boldischar, Lino Lakes, MN (US)
Assigned to Target Brands, Inc., Minneapolis, MN (US)
Filed by Target Brands, Inc., Minneapolis, MN (US)
Filed on May 4, 2021, as Appl. No. 17/307,481.
Prior Publication US 2022/0358126 A1, Nov. 10, 2022
Int. Cl. G06F 16/22 (2019.01); G06F 16/2452 (2019.01); G06F 16/28 (2019.01)
CPC G06F 16/24526 (2019.01) [G06F 16/2272 (2019.01); G06F 16/288 (2019.01)] 10 Claims
OG exemplary drawing
 
1. A computer-implemented method comprising:
receiving a message comprising an origin, a destination and a specified type for a relationship between the origin and the destination, the message further comprising a payload and a document unique identifier, the message received from a source other than a searchable datastore;
using the message to locate a first node in a graph database for the origin;
using the message to locate a second node in the graph database for the destination;
using the message to locate a relationship of the specified type between the first node and the second node in the graph database;
removing the document unique identifier from a list of other document unique identifiers maintained for the relationship of the specified type between the first node and the second node, wherein each document unique identifier in the list of document unique identifiers is associated with a respective message that included the origin, the destination and the specified type for the relationship between the origin and the destination; and
determining that the list of document unique identifiers is empty and in response removing the relationship of the specified type from between the first node and the second node to reduce the size of the graph database.