vanguard-memory-node
Related Servers
Alternatives to vanguard-memory-node
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityDmaintenanceA searchable long-term memory server for AI agents using BM25 indexing over document chunks, enabling durable recall across sessions without cloud dependencies.1Apache 2.0
- AlicenseAqualityBmaintenanceLocal-first agent memory & knowledge service: hybrid retrieval (vector + BM25/RRF) + memory governance (decay, dedup, freshness), REST + MCP dual protocol, fully offline without LLM. Python.2482Apache 2.0
- AlicenseNot gradedqualityCmaintenancePersistent, searchable memory for AI agents over the Model Context Protocol, enabling memory storage, full-text search with BM25 ranking, and retrieval across sessions.15 npmMIT
- AlicenseNot gradedqualityCmaintenanceLocal-first long-term memory database for AI systems, providing SQLite FTS5/BM25 retrieval and optional SentenceTransformer embeddings via MCP server.MIT
- AlicenseAqualityAmaintenancePersistent memory for AI agents with sectioned entries (project/user/context/etc), semantic search, CLI, and per-project scope. Local JSON, zero config, no server required.1289 PyPI4MIT
- FlicenseNot gradedqualityBmaintenancePersistent semantic memory MCP server for AI agents with hybrid search, LLM scoring, and decay engine, fully local.2-
TDQS
Scored across 11 tools
Each tool targets a distinct operation (ingest, search, recall, delete, index management), so selection is mostly clear. The search/recall and ingest/ingest_file pairs are related but descriptions differentiate candidate-root listing versus evidence retrieval and raw-text versus cursor-tracked file ingestion.
All tools share the vmn_ prefix and most use an imperative verb (recall, ingest, delete, rebuild, sync), which is easy to predict. vmn_stats and vmn_index_status break the verb-first pattern by using noun phrases, but this is a minor inconsistency.
Eleven tools is a reasonable size for a memory-vault server and every tool addresses a concrete function: storage, retrieval, deletion, stats, index health, and external sync. It avoids both bloat and minimalism for the stated scope.
The surface covers the core memory lifecycle: ingest text/files, list, search, recall evidence, inspect metadata, delete, index maintenance, stats, and sync. No critical dead ends appear, though there is no explicit update operation—probably appropriate because memory objects are addressed by immutable hashes.