AI Chat AI Image Generator AI Video Text to Speech

Enumeration Complexity of Unions of Conjunctive Queries

12/10/2018

∙

by Nofar Carmeli, et al.

∙

∙

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

Nofar Carmeli
13 publications
Markus Kröll
4 publications

page 1

page 2

page 3

page 4

research

∙ 12/21/2017

Enumeration Complexity of Conjunctive Queries with Functional Dependencies

We study the complexity of enumerating the answers of Conjunctive Querie...

0 Nofar Carmeli, et al. ∙

research

∙ 12/02/2021

A short note on the counting complexity of conjunctive queries

This note closes a minor gap in the literature on the counting complexit...

0 Stefan Mengel, et al. ∙

research

∙ 06/28/2022

Which arithmetic operations can be performed in constant time in the RAM model with addition?

In the literature of algorithms, the specific computation model is often...

0 Étienne Grandjean, et al. ∙

research

∙ 09/18/2017

Enumeration on Trees under Relabelings

We study how to evaluate MSO queries with free variables on trees, withi...

0 Antoine Amarilli, et al. ∙

research

∙ 03/17/2022

Efficiently Enumerating Answers to Ontology-Mediated Queries

We study the enumeration of answers to ontology-mediated queries (OMQs) ...

0 Carsten Lutz, et al. ∙

research

∙ 06/10/2022

Conjunctive queries with self-joins, towards a fine-grained complexity analysis

The complexity of evaluating conjunctive queries without self-joins is w...

0 Nofar Carmeli, et al. ∙

research

∙ 12/23/2019

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration

As data analytics becomes more crucial to digital systems, so grows the ...

0 Nofar Carmeli, et al. ∙