qdrant-kuzu-mcp
Related Servers
Alternatives to qdrant-kuzu-mcp
No user-submitted related servers found.
Related Servers
- AlicenseBqualityDmaintenancePersistent, graph-powered memory for AI agents that provides long-term semantic recall using a local Kuzu graph database.554MIT
- AlicenseNot gradedqualityDmaintenanceEnables storing and retrieving information using semantic search with Qdrant vector database. Acts as a memory layer for LLMs to persistently store and semantically search through information and metadata.Apache 2.0
- AlicenseNot gradedqualityDmaintenanceEnables storing and querying a personal knowledge graph as a shared memory, allowing agents and tools to remember facts, entities, relations, and recall relevant context via natural language hybrid search.1MIT
- AlicenseNot gradedqualityBmaintenanceEnables agents to build and query structured semantic graphs, extracting, traversing and multi-hop reasoning over entity-relation-object triples while producing Cypher and JSON-LD graph output. It also combines BM25 lexical and dense vector retrieval with rank fusion, semantic caching and context reordering for grounded agentic memory.7MIT
- AlicenseNot gradedqualityBmaintenanceEnables persistent, graph-based memory for AI agents, allowing them to store, traverse, and recall relationships between facts, decisions, and context across sessions for efficient reasoning and reduced token usage.MIT
- AlicenseAqualityDmaintenanceEnables LLM agents to use associative memory with key/value graph-based retrieval, supporting multi-hop traversal and human-like associative leaps beyond embedding similarity.10MIT
TDQS
Scored across 2 tools
The two tools are exact opposites — one stores, one retrieves — so there is no possibility of confusing their purposes. Each tool's role is clear from its name and description.
Both tools follow the same verb-oriented convention with a consistent 'qdrant-' prefix: qdrant-find and qdrant-store. The pattern is uniform and predictable.
At two tools, the server is on the thin side — it covers the bare minimum but feels underdeveloped for a memory system that could reasonably include more operations. The count is borderline rather than egregiously incomplete.
The basic store-and-retrieve lifecycle is present, but there are notable gaps: no way to delete, update, list all memories, or search by metadata. Agents can work around this, but the surface is minimal and lacks full memory management.