Benchmarking database systems for graph pattern matching

In graph pattern matching the task is to &#64257;nd inside a given graph some<br> speci&#64257;c smaller graph, called pattern. One way of solving this problem is to express it in the query language of a database system. We express graph pattern matching in four different query languages and benchmark corresponding database systems to evaluate their performance on this task. The considered systems and languages are the relational database PostgreSQL with SQL, the RDF database Jena TDB with SPARQL, the graph database Neo4j with Cypher, and the deductive database Clingo with ASP.