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 …

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 …

Subgraph counting is a fundamental graph analysis task which has been widely used in
many applications. As the problem of subgraph counting is NP-complete and hence …

We present an indexing scheme that supports worst-case optimal (wco) joins over graphs
within compact space. Supporting all possible wco joins using conventional data structures …

Subgraph counting, as a fundamental problem in network analysis, is to count the number of
subgraphs in a data graph that match a given query graph by either homomorphism or …

Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new
paradigm for one of the most fundamental challenges in query processing: computing joins …

Worst-case optimal multiway join algorithms have recently gained a lot of attention in the
database literature. These algorithms not only offer strong theoretical guarantees of …

The primordial function of a database system is to efficiently compute correct answers to
user queries. Therefore, robust query processing (RQP), where strong numerical guarantees …

Knowledge graphs (KGs) such as DBpedia, Freebase, YAGO, Wikidata, and NELL were
constructed to store large-scale, real-world facts as (subject, predicate, object) triples-that …

Motivated by fundamental applications in databases and relational machine learning, we
formulate and study the problem of answering functional aggregate queries (FAQ) in which …