Search Results for "graph database"

HelixDB is an open source database designed to unify multiple data storage paradigms into a single platform tailored for AI-driven applications. It combines graph and vector data models, allowing developers to manage relationships and embeddings within the same system without relying on separate services. HelixDB is built from scratch in Rust and uses LMDB as its storage engine, enabling high performance and low-latency query execution.

An implementation of the Model Context Protocol with Neo4j, enabling natural language interactions with Neo4j databases and facilitating operations such as schema retrieval and Cypher query execution. ​

...The platform supports multiple types of data sources and provides an end-to-end pipeline that includes intent recognition, SQL generation, database execution, and visual presentation of results. Its architecture includes multiple layers such as a web interface, API gateway, AI service layer, and data storage layer that support relational databases, vector stores, graph databases, and file systems.

...HASH is a platform for decision-making, which helps you integrate, understand and use data in a variety of different ways. HASH does this by combining various different powerful tools together into one simple interface. These range from data pipelines and a graph database, through to an all-in-one workspace, no-code tool builder, and agent-based simulation engine. These exist at varying stages of maturity, and while some are polished, not all are ready for real-world production use. You can read more about our big-picture vision at hash.dev

pgvector is an open-source PostgreSQL extension that equips PostgreSQL databases with vector data storage, indexing, and similarity search capabilities—ideal for embeddings-based applications like semantic search and recommendations. You can add an index to use approximate nearest neighbor search, which trades some recall for speed. Unlike typical indexes, you will see different results for queries after adding an approximate index. An HNSW index creates a multilayer graph. It has better...

Synabun is an open-source AI memory management and augmentation system designed to provide persistent, semantic memory for AI agents and coding assistants, particularly those compatible with the MCP (Model Context Protocol) ecosystem. It functions as a local-first solution that stores and retrieves contextual knowledge across sessions using a built-in vector database powered by embeddings, eliminating the need for external APIs, cloud services, or Docker dependencies. The system integrates tightly with developer workflows by running alongside tools like Claude Code, enabling automatic memory capture, retrieval, and contextual augmentation through lifecycle hooks and commands. One of its defining characteristics is its Neural Interface, a browser-based 3D visualization that represents stored memories as nodes in an interactive graph, allowing users to explore relationships, edit entries, and manage knowledge visually.

...Instead of relying on traditional sliding-window truncation or lossy summarization, it introduces a lossless architecture that preserves all historical messages while maintaining usable context within token limits. The system stores every interaction in a persistent database and incrementally summarizes older content into a hierarchical directed acyclic graph, allowing efficient compression without discarding information. This structure enables agents to dynamically reconstruct detailed context by expanding summaries when needed, effectively simulating perfect long-term memory.

Basic Memory is an open source knowledge system that turns AI conversations into persistent, structured knowledge you control. Instead of losing context after each chat, it stores information as simple Markdown files on your device, allowing both you and AI to read and write to the same knowledge base. It uses the Model Context Protocol (MCP) so compatible AI tools can access, update, and build on your notes across sessions. Basic Memory creates a semantic knowledge graph by linking related...

CoSD is a tool for searching and demonstrating code structure based on graph database. Since some commercial code is involved in the industrial version of CoSD , we just give out a baseline version of it. We also provide a quick demo for this baseline version. To use CoSD, please read the file readme.txt at first.

Wikipedia Concept Association Map (WCAM) is new approach for textual knowledge representation and understanding. All concepts and associations are stored in a graph database for better performance and easy distribution.

BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.

An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.

kroevet permit evaluation and vizualiation of knowledge robustness represented in conceptual graph forms