There are two types of high-performance graph processing engines: low-and high-level
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …

The LogicBlox system aims to reduce the complexity of software development for modern
applications which enhance and automate decision-making and enable their users to evolve …

Efficient join processing is one of the most fundamental and well-studied tasks in database
research. In this work, we examine algorithms for natural join queries over many relations …

We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

Graph data modeling and querying arises in many practical application domains such as
social and biological networks where the primary focus is on concepts and their …

We study the problem of optimizing subgraph queries using the new worst-case optimal join
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …

We define and study the Functional Aggregate Query (FAQ) problem, which encompasses
many frequently asked questions in constraint satisfaction, databases, matrix operations …

Worst-case optimal join algorithms are attractive from a theoretical point of view, as they offer
asymptotically better runtime than binary joins on certain types of queries. In particular, they …

Abstract GQL (Graph Query Language) is being developed as a new ISO standard for graph
query languages to play the same role for graph databases as SQL plays for relational. In …

A subgraph query searches for all embeddings in a data graph that are identical to a query
graph. Two kinds of algorithms, either graph exploration based or join based, have been …