Memgraph invites you to their event

Real-Time Payments Authorization with Memgraph

About this event

In the webinar, Martin Vo, the CTO of Paysure Solutions, offers insights into their experience using Memgraph for real-time payment authorization and enforcing various intricate rules. These rules span basic merchant categories and similarity or frequency checks to more complex insurance criteria. Utilizing Memgraph enabled them to achieve remarkably fast response times for their authorization service. This allowed them to determine promptly whether a payment should be authorized and record the expenditure — all with a single query. In effect, they replaced their complex payments stack, including aggregation workers, locking services, and message queues with Memgraph.

However, their journey with Memgraph was not without challenges. A significant hurdle was the size of their authorization query, which consisted of approximately 700 lines of code with numerous nested procedures. Fortunately, Memgraph's supportive community assisted them in overcoming these challenges, ensuring a production-ready state and preventing payment failures for their customers.

Hosted by

  • Guest speaker
    Martin Vo Chief Technology Officer @ Paysure Solutions Ltd

    CTO at Paysure Solutions Ltd., former Astrophysicist and Data Scientist turned Full Stack Developer. A. Functional programming and architecture design enthusiast, local chess prodigy (in the office at least!) and triathlete.

  • Team member
    Katarina Supe Developer Experience @ Memgraph

    DevRel, graph enthusiast and foodie who loves learning new technologies and enjoys using them in interesting everyday use cases.


Fastest, Most Affordable Graph Database. Light & Powerful. Tuned for Dynamic Analytics Environments.

Memgraph is a dynamic, lightweight graph database optimized for analyzing data, relationships, and dependencies quickly and efficiently. It offers a rich suite of pre-built deep path traversal algorithms and a library of traditional, dynamic, and ML algorithms tailored for advanced graph analysis.