Enumeration Complexity of Unions of Conjunctive Queries

12/10/2018

∙

by   Nofar Carmeli, et al.

∙

0

∙

share

We study the enumeration complexity of answering unions of conjunctive queries with respect to linear time preprocessing and constant delay.