|
|
|
|
|
by adsharma
87 days ago
|
|
For starters, LLMs themselves are a graph database with probabilistic edge traversal. Some apps want it to be deterministic. I'm surprised this question comes up so often. It's mainly from the vector embedding camp, who rightfully observe that vector + keyword search gets you to 70-80% on evals. What is all this hype about graphs for the last 20-30%? |
|
Do you have any good demos to showcase where graph DBs clearly have an advantage? Its mostly just toy made demos.
vector embeddings on the other hand no matter how limited clearly have proven themselves useful beyond youtube/linkedin thought leader demos.