FWO travel grant for a long stay abroad at the University of Wisonsin-Madison (R-7753)

For big data querying it is common to disperse data over a cluster of servers and let every server perform part of the computation locally. A good measure for the efficiency of such algorithms is the maximal load that any server receives during the query evaluation. The goal of this visit is to study achievable load guarantees for the computation of an extended class of queries.

Keywords:Database theory, distributed query evaluation

Disciplines:Applied mathematics in specific fields, Artificial intelligence, Cognitive science and intelligent systems