ckg-mcp
Related Servers
Alternatives to ckg-mcp
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityAmaintenanceA universal MCP server providing persistent, structured memory through a knowledge graph with graph storage, semantic vector search, and multi-hop traversal for AI agents and IDEs.1MIT
- FlicenseNot gradedqualityCmaintenanceAn in-memory knowledge graph MCP server that gives coding agents structural and semantic recall over codebases by indexing Python source, ADR documents, and project configuration, exposing 7 tools for search, traversal, context retrieval, and natural-language Q&A.-
- FlicenseNot gradedqualityNot gradedmaintenanceA Knowledge Graph MCP server optimized for LLM context efficiency through compact JSON and SQLite persistence. It enables full graph management including node/edge CRUD operations, full-text search, and subgraph traversal.-
- FlicenseNot gradedqualityCmaintenanceAn MCP server that lets LLM agents accumulate organizational knowledge across sessions, scoped by domain, backed by Neo4j with enforced structural invariants.-
- AlicenseNot gradedqualityCmaintenanceAn MCP server that enables AI agents to generate, search, and reason over knowledge graphs from code, databases, docs, and open-data portals without requiring an LLM or API key.Apache 2.0
- AlicenseNot gradedqualityFmaintenanceAgent-first knowledge graph MCP server that provides 25 tools for managing a knowledge graph with nodes and edges, plus a human-readable dashboard for LLMs and AI agents.465Apache 2.0
TDQS
Scored across 4 tools
Each tool has a distinct purpose: listing domains, searching concepts, getting full dependency subgraphs, and fetching only prerequisite chains. Descriptions explicitly differentiate when to use each, eliminating ambiguity.
All tool names follow a consistent verb_noun pattern with lowercase and underscores: list_domains, search_concepts, query_ckg, get_prerequisites.
Four tools is appropriate for a knowledge graph query server. Each tool covers a fundamental operation without redundancy or gaps.
The set covers the full lifecycle of querying a knowledge graph: listing domains, searching for concepts, and retrieving both prerequisite chains and full dependency neighborhoods. No obvious gaps given the read-only purpose.