Graph pattern matching is at the core of all graph query languages. What a user can or cannot do is limited by the expressiveness and performance of graph navigation-oriented capabilities.
Cypher has offered good graph pattern matching features since its inception, and this has been borne out by its popularity with users and widespread adoption across all sectors of industry. However, the increase in the number of 'graph problems' tackled by our customers, together with the increased size and complexity of the graphs, are showing the limitations of our query language. To date, these limitations have been overcome with workarounds, like the Traversal API and APOC traversal functions.
The upcoming GQL standard is giving us the opportunity to build a query language solution, and this talk will show you how we are turbocharging the graph pattern matching features of Cypher to give users the power they need to tackle modern complex graph problems.
Speakers: Nadja Müller, Petra Selmer
Format: Full Session 30-45 min
Level: Advanced
Topics: #Database, #Cypher, #General, #Advanced
Region: AMERICAS
Slides: https://dist.neo4j.com/nodes-20202-slides/004%20Graph%20Pattern%20Matching%20-%20NODES2022%20-%20AMERICAS%20Advanced%201%20-%20Nadja%20Mu%CC%88ller%2C%20Petra%20Selmer.pdf
Visit https://development.neo4j.dev/nodes-2022 learn more at https://development.neo4j.dev/developer/get-started and engage at https://community.neo4j.com