The max-sum labeling problem, defined as maximizing a sum of binary (ie, pairwise)
functions of discrete variables, is a general NP-hard optimization problem with many …

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 …

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 computing conjunctive queries over large databases on parallel
architectures without shared storage. Using the structure of such a query q and the skew in …

Evaluating the relational join is one of the central algorithmic and most well-studied
problems in database systems. A staggering number of variants have been considered …

Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe
and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full …

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

Relational joins are at the core of relational algebra, which in turn is the core of the standard
database query language SQL. As their evaluation is expensive and very often dominated …

Graph searching encompasses a wide variety of combinatorial problems related to the
problem of capturing a fugitive residing in a graph using the minimum number of searchers …

We give a complexity theoretic classification of homomorphism problems for graphs and,
more generally, relational structures obtained by restricting the left hand side structure in a …