Memgraph 2.4.0 is live!

Summer has been a busy time for us and in this rainy release of Memgraph we bring you four major features that are bound to make your life easier.

• All shortest paths will finally return all the shortest paths with the same minimum sum of weights. Read the How to Find All Weighted Shortest Paths Between Nodes and Do It Fast blog post to find out how it was implemented and how to use it!
• By using label-based authorization in the Enterprise edition of Memgraph you can increase the security of your data by managing user permissions on node label and edge type levels. Label-based access control in Memgraph - Securing first class graph citizens blog explains the road taken to develop this feature and how to utilize it.
• The project() function creates a projected graph allowing you to run any function or a query module on a subgraph! Check our docs to find out how!
• [C++ API] will make writing query modules a breeze and a pleasant experience.

This release also fixed issues with replication and queries regarding it, handling ROUTE Bolt messages, and toString() function now correctly converts temporal units. For more details, check the Memgraph changelog.

Read more

Oh, and if you haven't heard, we're hiring! 👩‍💻

If you, or someone awesome you know, want to help us build the future of graph apps, check out our open positions below. 👇

• Developer Advocate
• Software Engineer - Core Database Engine
• Content Marketing Manager

See open positions

What Next?

Let us know what you are building with Memgraph and how we can help. Simply drop us a note on our community forum or Discord server, and we'll be right with you!

"If you'd like to give Memgraph a spin, download it for free or start a 14-days free trial of Memgraph Cloud.”

That's it for today. Have a great weekend and until next time!

– The Memgraph Team

‍