MCP Index Notes
Related Servers
Alternatives to MCP Index Notes
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityCmaintenanceEnables semantic search, connection discovery, and grounded synthesis across your Apple Notes using on-device embeddings and optional LLM synthesis, with direct SQLite access for fast indexing.7 npm8MIT
- FlicenseNot gradedqualityAmaintenanceEnables creating, linking, searching, exploring, and synthesizing atomic notes as a knowledge graph through MCP-compatible clients such as Claude. Supports tags, note types, semantic relationships, Markdown storage, and an SQLite index for efficient traversal.-
- FlicenseNot gradedqualityAmaintenanceEnables users to create, link, search, explore, and synthesize atomic notes through MCP-compatible clients such as Claude, using tags, semantic bidirectional links, and Markdown source files with a SQLite index.-
- FlicenseNot gradedqualityAmaintenanceEnables users to create, link, explore, and synthesize atomic notes as a knowledge graph through Claude and other MCP-compatible clients. It supports tagging, search, note types, semantic link types, and Markdown-file storage indexed by SQLite.-
- FlicenseNot gradedqualityAmaintenanceEnables users to create, link, tag, search, explore, and synthesize atomic notes through Claude and other MCP-compatible clients. Notes are stored as readable Markdown files with a SQLite index, supporting semantic link types and graph-based discovery of connected ideas.-
- FlicenseNot gradedqualityAmaintenanceEnables Claude and other MCP-compatible clients to create atomic notes, link them with semantic relationship types, tag and search them, and traverse the resulting knowledge graph for exploration and synthesis. Notes are stored as human-readable Markdown files that remain the source of truth, with a rebuildable SQLite index for fast querying.-
TDQS
Scored across 16 tools
Most tools have distinct purposes, but some overlap exists: 'graph-neighbors' and 'graph-path' both involve graph traversal, which could cause minor confusion. However, descriptions clarify that 'graph-neighbors' retrieves connected nodes while 'graph-path' finds specific paths, helping to differentiate them. Other tools like 'index-query' and 'index-list-keys' are clearly separate in function.
Tool names follow a highly consistent pattern throughout, using a clear 'category-action' format (e.g., 'graph-import-from-notes', 'image-delete', 'index-backup'). This consistency makes it easy to predict tool purposes and group related operations, with no deviations or mixed conventions observed.
With 16 tools, the count is slightly high but reasonable for the server's scope, which covers graph operations, image management, and note indexing. It feels comprehensive without being overwhelming, though a few tools like 'index-health' might be considered optional, slightly reducing efficiency.
The tool set provides complete coverage for the domain of note and graph management, including CRUD operations (e.g., upsert, delete, get), querying, backup/restore, and health checks. There are no obvious gaps; agents can perform full lifecycles for notes, images, and graph nodes without dead ends.