Home Projects memgraph
memgraph
C++

memgraph

High-performance open-source in-memory graph database for GraphRAG, AI memory, agentic AI, and real-time graph analytics. Cypher-compatible, built in C++.

by memgraph · GitHub
Stars
Forks
Created
Last commit
Category
Language
aiai-agentsai-memoryC++
View on GitHub
In plain words

Manage and analyze connected data using a fast, in-memory graph database designed for AI applications.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
memgraph — GitHub preview card
📈 Star history
4.4k4.2k
2026-07-072026-08-31
📈 Track memgraph

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

High-performance open-source in-memory graph database for GraphRAG, AI memory, agentic AI, and real-time graph analytics. Cypher-compatible, built in C++.

memgraph has 4.4k stars on GitHub. It has been forked 262 times. memgraph is written mainly in C++. It has been in active development since 2020. Its main topics are ai, ai-agents, ai-memory, context-graph.

Frequently asked questions

What is memgraph?

High-performance open-source in-memory graph database for GraphRAG, AI memory, agentic AI, and real-time graph analytics. Cypher-compatible, built in C++.

Is memgraph open source?

memgraph is an open-source project.

Is memgraph free?

Yes. memgraph is free and open source — you can use, modify and self-host it.

What language is memgraph written in?

memgraph is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — memgraph

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=memgraph-memgraph)](https://olud.ai/project/memgraph-memgraph.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.