Worst-case optimal join algorithms are the class of join algorithms whose runtime match the
worst-case output size of a given join query. While the first provably worse-case optimal join …

There is a long tradition in understanding graphs by investigating their adjacency matrices
by means of linear algebra. Similarly, logic-based graph query languages are commonly …

We investigate the expressive power of MATLANG, a formal language for matrix
manipulation based on common matrix operations and linear algebra. The language can be …

We investigate the expressive power of $\mathsf {MATLANG} $, a formal language for matrix
manipulation based on common matrix operations and linear algebra. The language can be …

A coreset is a small set that can approximately preserve the structure of the original input
data set. Therefore we can run our algorithm on a coreset so as to reduce the total …

We introduce StarfishDB, a query execution engine optimized for relational probabilistic
programming. Our engine adopts the model of Gamma Probabilistic Databases …

Inference enables an agent to create new knowledge from old or discover implicit
relationships between concepts in a knowledge base (KB), provided that appropriate …

Join operations (especially n-way, many-to-many joins) are known to be time-and resource-
consuming. At large scales, with respect to table and join-result sizes, current state of the art …

The amount of spatial data acquired from crowdsourced platforms, mobile devices, sensors
and cartographic agencies has grown exponentially over the past few years. Nearly half of …

We study the expressive power of the Lara language–a recently proposed unifying algebra
for expressing relational and linear algebra operations–both in terms of traditional database …