Replies: 1 comment
-
|
I wil create implementation docs and start working on this as it seems not a to big effort to do this for sharpcoredb (80% already fits) |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Hi Michel!
First off, massive kudos on v1.2. The HNSW implementation is flying 🚀. Having a native .NET embedded DB that handles both structured data and vectors this fast is a game-changer for the ecosystem.
I’ve been thinking about the next logical step, especially for those of us building AI Agents and Local LLM tools (like my current project).
Missing Piece: GraphRAG
Vector search (HNSW) is perfect for "fuzzy" semantic retrieval, but it lacks structural precision. For code analysis or complex knowledge bases, we often need to answer:
"Find chunks semantically similar to this query, BUT only if they are connected to
Class Xwithin 2 hops."Doing 3+ hop traversals with standard SQL
JOINs on B-Trees gets expensive fast.Idea
I'm not suggesting a full Cypher implementation, but rather structural optimizations to support graph-like traversals efficiently:
FILESTREAMor array support?).Inspiration / Competitors to watch
You don’t need to be Neo4j. I’d look at the "Embedded Graph" players:
Why this matters
If SharpCoreDB can handle Vectors + Relations (Graph) in a single embedded, zero-dependency DLL, it essentially becomes the ultimate memory backend for .NET AI Agents, significantly outperforming a
SQLite + Extensionsstack.Would love to hear your thoughts on if/how this could fit into the roadmap!
Beta Was this translation helpful? Give feedback.
All reactions