March 2022 Summaries

Memgraph's Developer Relations (DevRel) team, consisting of Katarina and Ivan, is visiting Amsterdam to present at several meetups focused on graph-based technologies. On Wednesday, April 6, 2022, they will participate in two events: the PyAmsterdam meetup at KPN offices, where Katarina will discuss "Graph-based stream processing in Python," and the Graph Neural Networks and Graph Application Platforms meetup at Hyperion Lab organized by the Amsterdam Applied Machine Learning group. On Friday, April 8, 2022, they will speak at an Apache Pulsar meetup organized by the Netherlands Apache Pulsar Meetup group at The Hacker Building. Attendees interested in discussing graph technologies can connect with Katarina and Ivan via Twitter or LinkedIn.

Benjamin Antal, a software engineer based in the Netherlands, has significantly contributed to Memgraph since joining the Core team a year ago, despite having limited prior database experience. Previously a C++ enthusiast with a background in Java test automation, Benjamin has been involved in the development of Memgraph's Kafka integration and distributed system design, marking these as his proudest achievements. He employs a Linux Mint setup with tools like CMake and Clang, while also engaging with C++, Python, and occasionally Rust, which he considers a promising future replacement for C++. Outside of work, Benjamin enjoys bouldering, biking, and team sports, finding balance in his life through these activities. He emphasizes the importance of effective communication and a friendly team atmosphere in maintaining connectivity within Memgraph's fully remote and diverse Core team.

The tutorial provides a step-by-step guide to using Memgraph, a graph database platform, for analyzing Twitter networks through a Jupyter Notebook. It outlines the prerequisites such as installing Jupyter, Docker, GQLAlchemy, and Pandas, followed by instructions on setting up Memgraph using Docker. The tutorial demonstrates how to connect to Memgraph with GQLAlchemy, define a graph schema using Python classes, and create nodes and relationships with Cypher queries, a query language for graph databases. It also explains importing data from CSV files into Memgraph, querying the database, and retrieving results using both Cypher and the GQLAlchemy query builder. Additionally, it covers calculating PageRank for nodes to assess their importance within the network and visualizing the graph in Memgraph Lab, a browser-based interface, to make it more descriptive. The tutorial encourages users to explore Memgraph Playground for additional use cases and join the Discord community for support and collaboration.

Graph Data Zagreb, a group for enthusiasts of graph databases and technologies, is hosting an in-person meetup on April 6 at WESPA Spaces in Zagreb, Croatia. The event will feature Goran Cvijanović, a senior software architect with extensive experience in database systems, who will discuss using graph databases to detect vulnerabilities in GitHub repositories, specifically in the context of the log4j vulnerability CVE-2021-44228. This vulnerability had exposed many Java servers to exploitation, prompting companies and engineers to seek solutions for identifying exposure. The meetup aims to provide a platform for learning about and discussing graph-based technologies, and attendees are encouraged to RSVP and join the group's events and discussions, both in person and on Discord.

The tutorial provides a step-by-step guide on migrating a movie dataset from Neo4j, an ACID-compliant transactional native graph database, to Memgraph, a platform designed for graph computations on streaming data. It details the use of Docker to run both databases and the procedures to export data from Neo4j using the `apoc.export.csv.all()` function, followed by importing it into Memgraph using the `LOAD CSV` clause. The process involves exporting the dataset to a CSV file, copying it between Docker containers, and importing nodes and their relationships into Memgraph. The tutorial also suggests verifying the data migration by comparing query results in both databases and invites users to explore alternative migration methods and share them with the Memgraph community.

The article explores 20 popular graph algorithms and their real-world applications across various fields. Graph theory, which involves studying graphs composed of vertices and edges, is essential for modeling complex data scenarios like social networks, transportation, and communication systems. The text discusses algorithms such as Breadth-First Search (BFS), which is used in peer-to-peer networks and web crawlers; Depth-First Search (DFS), applied in scheduling and cycle detection; Dijkstra's and A* algorithms, employed for finding the shortest paths in network routing; and the Minimum Spanning Tree algorithm, which aids in designing efficient network layouts. Other algorithms like the Bellman-Ford, Floyd-Warshall, and Johnson's are highlighted for their roles in solving shortest path problems, while algorithms such as Tarjan's and Kosaraju's focus on identifying strongly connected components. The article also covers specialized algorithms like Boyer-Moore for string searching and the Greedy algorithm for optimization tasks, showcasing the versatility of graph algorithms in addressing diverse computational challenges.

Memgraph has developed a comprehensive onboarding process to ensure new employees are well-integrated into the company culture and operations, which begins as soon as a new hire accepts an offer. The process is divided into three subcategories: legal onboarding, general onboarding, and team onboarding. Legal onboarding involves coordinating personal details and legal paperwork, while general onboarding includes equipping new employees with necessary tools and information, such as company equipment and account access, and introducing them to company culture through presentations like Pecha Kucha. Team onboarding is tailored by individual managers to fit team needs and includes opening team-specific accounts and regular meetings. Memgraph, being a fully remote company, has established a company wiki on Notion for easy access to policies and benefits, and uses onboarding checklists and feedback surveys to continually improve the experience, ensuring new hires are supported until they are fully settled in their roles.

The first Graph Data Zagreb meetup took place at WESPA Spaces on March 2, 2022, bringing together graph technology enthusiasts from various technical backgrounds to share knowledge and experiences. Dominik, Memgraph's founder and CEO, delivered a presentation on current graph technologies, sparking engaging discussions among participants who shared insights from their direct experiences with these tools. The event provided an opportunity for attendees to network, discuss their research, and enjoy refreshments, while receiving MemDucks and T-shirts as souvenirs. The next meetup is scheduled for April 6, 2022, featuring Goran Cvijanović from ReversingLabs, who will discuss detecting GitHub repository vulnerabilities using graph databases. Attendees are encouraged to RSVP and join the #graph-data-zagreb channel on Discord to stay updated on future events.

The chemical industry, a key player in sectors like agriculture and automotive, is undergoing a digital transformation driven by advancements in hardware and software technology, with graph models and algorithms playing a crucial role. Graph technology is enhancing real-time process optimization by improving process model accuracy and reducing maintenance costs while also addressing supply chain scheduling challenges through the integration of data from various sources. Memgraph, a prominent tool in this domain, facilitates the creation of chemical digital twins by integrating data from diverse systems and enabling advanced optimization and simulation algorithms. Memgraph's property graph model offers an intuitive way to represent complex data without intricate constructs and is designed for high performance and resilience, supporting both transactional and analytical queries with features like automatic snapshots and ACID transactions.

Graph algorithms are fundamental for solving various coding challenges, particularly in developer interviews, and understanding these algorithms can prove advantageous. Graphs are non-linear data structures composed of nodes (vertices) and edges (paths), with practical applications such as Facebook's Graph API. Key graph algorithms include Breadth-First Search (BFS) and Depth-First Search (DFS) for traversing graphs, Dijkstra's and Bellman-Ford for finding the shortest paths, and Floyd-Warshall for the All Pairs Shortest Path problem. Prim's and Kruskal's algorithms are used to find minimum spanning trees, while the Topological Sort algorithm provides a linear ordering of vertices in a directed acyclic graph. Johnson's algorithm is notable for finding shortest paths in graphs with potentially negative weights, and Kosaraju's algorithm identifies strongly connected components. These algorithms employ various data structures such as queues, stacks, and priority queues, emphasizing the versatility and efficiency of graph theory in computational tasks.

In the realm of information systems, finding the shortest path in a network is a critical task, with applications spanning various fields such as geography, management, transportation, and computer science. This requires the development and implementation of efficient algorithms, each selected based on network parameters and execution time. Notable algorithms include Dijkstra's, which is used for determining the shortest path between two geographical points; Bellman-Ford, which can handle negative edge weights; Floyd-Warshall, which finds shortest paths for all vertex pairs; and Johnson's, which is suited for edge-weighted directed graphs with negative numbers but no negative cycles. These algorithms are integral to applications like Google Maps, emergency response systems, logistics, telecommunications, social networking, and more, offering solutions to complex problems ranging from optimal routing and network data transmission to job scheduling and route inspection in graph theory.

Europe is grappling with an energy crisis due to low natural gas stock and soaring prices, exacerbated by a colder-than-expected winter and poor wind power generation. The continent's reliance on imported natural gas, particularly from Russia, is significant, with nearly 90% of the EU's gas being imported and Russia accounting for 43.4% of these imports in 2019. The Nord Stream 2 pipeline, intended to secure supply from Russia, remains unopened amid geopolitical tensions, leaving Europe vulnerable to potential Russian supply cuts. Alternatives like Liquefied Natural Gas (LNG), which the US leads in exporting, offer some diversification but cannot fully offset a Russian gas shortfall due to limited short-term capacity. Graph analytics, such as those provided by SciGRID_gas, can help visualize and analyze the European gas network to prepare for disruptions and mitigate potential energy crises.