Before revision:  We develop a compositional algorithm to process full join queries when data is stored in said structures, and then show that the running time of this algorithm is worst-case optimal in data complexity.
After revision:  We develop a compositional algorithm to process full join queries under this representation, and show that the running time of this algorithm is worst-case optimal in data complexity.