We study the problem of computing the join of n relations in multiple rounds of MapReduce. We introduce a distributed and generalized version of Yannakakis’s algorithm, called GYM. GYM takes as input any generalized hypertree decomposition (GHD) of a query of width w and depth d, and computes the query in O(d+log(n)) rounds andO(n (IN +OUT) M ) communication cost, where M is the memory availabl...

In this paper we experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-)hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multicore architectures, it has been argued that sort-merge join is now a better choice than radix-hash join. This...

We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queries are considered generalized programing expressions which may be used within macroscopic imperative statements, such as creating, updating, inserting, and deleting data objects. Queries may be also used as procedures’...

We propose a parametric version of Independent Component Analysis (ICA) via Copulas families of multivariate distributions that join univariate margins to multivariate distributions. Our procedure exploits the role for copula models in information theory and in measures of association, specifically: the use of copulae densities as parametric mutual information, and as measures of association on...

Pigeons made repeated choices between earning and exchanging reinforcer-specific tokens (green tokens exchangeable for food, red tokens exchangeable for water) and reinforcer-general tokens (white tokens exchangeable for food or water) in a closed token economy. Food and green food tokens could be earned on one panel; water and red water tokens could be earned on a second panel; white generaliz...

We explore the connection between polygon posets, which is a class of ranked posets with an edgelabeling which satisfies certain 'polygon properties', and the weak order of Coxeter groups. We show that every polygon poset is isomorphic to a join ideal in the weak order, and for Coxeter groups where no pair of generators have infinite order the converse is also true. The class of polygon posets ...