I have very little experience with graph DBs but i imagine this problem suits one
Assume a dataset with two entities , Users and Foods. A user can have a relationship with a Food, specifically they can score it from 0 to 100.
What i'd like to achieve is, for every user, find all the other users that are similar to them. By similar i mean find the Users that have also liked similar Foods and get a match so essentially im trying to build a a matchmaking system.
Algorithms such as finding friend's of friends are relatively easy to wrap my head around however im unsure as to how to approach this one and wether describing my data as a graph is even the right way to go about it.
I originally made a thought experiment to see how this would look on a relational database and its clearly quite hard to achieve as for every insert of a new Food or User, recalibration would need to happen for the entire database ( which sounds unavoidable in the first place )
I dont know what i dont know so if you could give me some pointers from here i'd be happy to follow your leads. Thanks so much.