Skip to main content
Glama

Graph Search

graph_search
Read-onlyIdempotent

Find what the graph knows about something, plus its neighbourhood. FREE.

Scores entities by how many query words appear in the name, type and observations, then pulls in whatever is within the requested number of hops - because the useful answer to "what do we know about Acme" is usually Acme plus who it is connected to. Typical input {"graph": {...}, "query": "acme renewal", "hops": 1} returns {"matches": [{"name": "Acme Corp", "score": 3, "why": ["name", "observation"]}], "neighbourhood": {"entities": [...], "relations": [...]}, "hops": 1}.

Use to read memory back before answering. Not for writing (graph_upsert) and not for narrowing by date, which graph_at_time does. Errors: on invalid, missing, or malformed input this tool never raises a protocol error — it returns {"error": ""} (for example {"error": "query must contain at least one word or number"}). Every call is read-only and idempotent, so after correcting the input it is always safe to retry.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
hopsNoHow far to expand from each match along relations. 0 returns matches only; 3 is the maximum. Default 1.
graphYesThe graph document to search.
limitNoMaximum entities to return. Default 20, maximum 200.
queryYesWords to look for, e.g. "acme renewal". Matching is on whole lowercase words, so it is exact and repeatable rather than fuzzy.

Output Schema

TableJSON Schema
NameRequiredDescriptionDefault

No arguments

TDQS

A5/5.0
Behavior5/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

Beyond the annotations (read-only, idempotent), the description reveals scoring logic, neighbourhood inclusion, exact word matching, and error behavior (never raises protocol errors, returns error objects). It also states 'Every call is read-only and idempotent,' reinforcing the annotations, and explains the rationale behind neighbourhood pulls.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness5/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is concise yet packed with information: a clear opening line, a concrete example, usage guidance, and error handling—all in about 150 words. Every sentence earns its place without redundancy, making it highly effective.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness5/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

Given the tool's complexity and the presence of an output schema, the description covers essential aspects: purpose, scoring, hops semantics, error behavior, and safety guarantees. It addresses potential pitfalls (e.g., invalid input) and provides a complete mental model for correct usage.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters5/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

While the schema fully describes parameters, the description enriches query semantics with 'Matching is on whole lowercase words' and explains hops with '0 returns matches only.' The example ties graph, query, and hops together, providing practical meaning beyond mere schema definitions.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description clearly states the tool's purpose: 'Find what the graph knows about something, plus its neighbourhood.' It uses a specific verb ('Find') and resource ('the graph'), then elaborates with scoring and hop-based expansion. It also distinguishes from siblings by explicitly mentioning graph_upsert and graph_at_time, leaving no ambiguity about its role.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines5/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

Explicit usage guidance is provided: 'Use to read memory back before answering. Not for writing (graph_upsert) and not for narrowing by date, which graph_at_time does.' This directly tells when to use this tool versus alternatives, and the error-handling note adds when retries are safe.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Try in Browser

Glama MCP Gateway

Add one secure layer between your agents and this server.

TDQS

A4.9/5.0
Disambiguation5/5

Each tool has a distinct, non-overlapping purpose: time-based query, compaction, diff, lint, search, and upsert. No ambiguity between them.

Naming Consistency5/5

All tools follow a consistent 'graph_' prefix with descriptive verb suffixes, forming a clear and predictable naming pattern.

Tool Count5/5

Six tools is an appropriate number for a memory graph server, covering all essential operations without redundancy or bloat.

Completeness5/5

The toolset provides full coverage: upsert for writing, search and at_time for reading, diff for change tracking, lint for validation, and compact for maintenance. No gaps.

Resources