Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …

In the database context, the hypertree decomposition method is used for query optimization,
whereby conjunctive queries having a low degree of cyclicity can be recognized and …

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 …

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 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 …

Many applications detect the emergence or deletion of certain subgraphs in their input
graphs continuously. In order to evaluate such continuous subgraph queries, these …

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 …

Triangle counting and enumeration has emerged as a basic tool in large-scale network
analysis, fueling the development of algorithms that scale to massive graphs. Most of the …