Skip to main content
Glama
521,628 tools. Updated 2026-09-06 11:42

"How to Query a Knowledge Graph Using an Ontology" matching MCP tools:

Matching MCP Servers

  • A
    license
    Not graded
    quality
    C
    maintenance
    A minimal MCP server with get_weather and create_ticket tools, used for testing MCP servers across protocol, unit, eval, transport, and auth layers.
    MIT
  • A
    license
    Not graded
    quality
    A
    maintenance
    Enables fast, targeted queries against an Obsidian vault knowledge graph using tools like search, neighbor traversal, and pathfinding, without needing to load the full graph into LLM context.
    2
    MIT

Matching MCP Connectors

  • Architecture-grounded query for AI agents. Governance constraints, system dependencies, evidence.

  • Read-only WooCommerce checkout and revenue incident diagnosis using privacy-safe store signals and public release evidence.

  • Answer factual questions from a shared knowledge graph, grounded in evidence with citations. Abstains when the graph lacks knowledge.
    MIT
  • Paginate a single search query across multiple pages, merging deduplicated organic results while retaining Google enrichments like AI Overview and Knowledge Graph. Billed per page fetched.
    MIT
  • List entities in the knowledge graph, optionally filtered by type, to obtain an overview or entity names for graph queries. Supports D3-compatible JSON output.
    MIT
  • Search persistent memory using semantic similarity to retrieve relevant memories and related knowledge graph facts.
    MIT
  • Query the knowledge graph to find entities connected to a given entity, revealing relationships and dependencies within specified depth.
    MIT
  • Search the CodeLogic knowledge graph to retrieve code and data architecture dependencies. Use a text query or identity prefix, with optional scan space and view filters.
    Mozilla Public 2.0
  • Remove a subject-predicate-object relationship from the knowledge graph by providing the triple ID. Receive a JSON confirmation of deletion.
    MIT
    Destructive
  • Query project knowledge-graph context with tier filtering. Specify budget and pattern to get relevant evidence-anchored facts.
    MIT
  • Explore the knowledge graph hierarchy from a starting node, viewing three levels of children to understand knowledge organization before searching or saving.
    MIT
  • Rank knowledge-graph nodes by importance using PageRank, optionally personalized by query, to surface top concepts for condensation, search ranking, and documentation sourcing.
    Apache 2.0
  • Extracts circuit topology and components from schematic images, then cross-references a knowledge graph to provide engineering insights and related principles.
    MIT
  • Traverse the knowledge graph from a component or page to see how it connects to the rest of the app, returning nodes and edges within a configurable hop depth.
    MIT