We investigate trade-offs in static and dynamic evaluation of hierarchical queries with
arbitrary free variables. In the static setting, the trade-off is between the time to partially …

This paper studies communication-oblivious algorithms under the massively parallel
computation (MPC) model. The communication patterns of these algorithms follow a …

This paper studies multi-way join queries over temporal data, where each tuple is
associated with a valid time interval indicating when the tuple is valid. A temporal join …

We study equi-join computation in the massively parallel computation (MPC) model.
Currently, a main open question under this topic is whether it is possible to design an …

In this paper, we study parallel query processing with a focus on reducing the
communication cost, which is the dominating factor in parallel query processing. The …

We study the design and analysis of parallel join algorithms in a topology-aware
computational model. In this model, the network is modeled as a directed graph, where each …

We study the classical evaluation problem for regular path queries: Given an edge-labeled
graph and a regular path query, compute the set of pairs of vertices that are connected by …

During the past decades significant efforts have been made to propose data structures for
answering connectivity queries on fully dynamic graphs, ie, graphs with frequent insertions …

The semantic web is designed to provide machine accessible meaning for its constructs.
Semantic web depends on Resource Description Framework (RDF), which is a standard …

This paper presents an algorithm to process a multi-way join with load \tO(n/p^2/(αφ)) under
the MPC model, where n is the number of tuples in the input relations, α the maximum arity …