A glimpse on constant delay enumeration

A glimpse on constant delay enumeration. Luc Segoufin. INRIA and ENS Cachan. Abstract. We survey some of the recent results about enumerating the answers to ...

[PDF] A glimpse on constant delay enumeration | Semantic Scholar

Several scenarios when the enumeration of the answers to queries over a database is performed with a constant delay between any two consecutive solutions, ...

A glimpse on constant delay enumeration (Invited Talk) - DROPS

A glimpse on constant delay enumeration (Invited Talk) · File · Document Identifiers · Author Details · Cite AsGet BibTex · Abstract · Metrics.

A glimpse on constant delay enumeration - Inria - Institut national de ...

We survey some of the recent results about enumerating the answers to queries over a database. We focus on the case where the enumeration is performed with ...

A glimpse on constant delay enumeration (Invited Talk) | Semantic ...

This work focuses on the case where the enumeration is performed with a constant delay between any two consecutive solutions, after a linear time ...

Constant-Delay Enumeration for Nondeterministic Document ...

We pose this problem in the setting of enumeration algorithms, where we can first run a preprocessing phase and must then produce the results ...

Constant delay enumeration for conjunctive queries: a tutorial

This paper is the tutorial we wish we had had available when starting our own research on constant delay enumeration for conjunctive queries.

Constant-Delay Enumeration for Nondeterministic Document ... - arXiv

Further, it. Page 3. A. Amarilli, P. Bourhis, S. Mengel and M. Niewerth. 19:3 was conjectured that such an algorithm is unlikely to exist [11] ...

Constant-Delay Enumeration for Nondeterministic Document ...

We pose this problem in the setting of enumeration algorithms, where we can first run a preprocessing phase and must then produce the results with a small delay ...

Constant-Delay Enumeration for Nondeterministic Document ...

In this model, extraction is performed by evaluating a par- ticular kind of automata, called a sequential variable-set automaton (VA). The efficiency of this ...

Constant delay enumeration for conjunctive queries - CiteSeerX

We survey some of the recent results about enumerat- ing the answers to queries over a database. We focus on the case where the enumeration is performed with a.

Constant-Delay Enumeration for Nondeterministic Document ... - arXiv

We pose this problem in the setting of enumeration algorithms, where we can first run a preprocessing phase and must then produce the results with a small delay ...

Constant-Delay Enumeration for Nondeterministic Document ... - OUCI

L. Segoufin . A glimpse on constant delay enumeration (Invited talk) . In STACS , 2014 . L. Segoufin. A glimpse on constant delay enumeration (Invited ...

Constant Delay Enumeration for Conjunctive Queries - ResearchGate

A large body of work on enumeration [14,36,75,107, 114] has traditionally focused instead on measuring the delay between answers after a preprocessing phase, ...

Luc Segoufin's papers

PODS 2018. Constant delay enumeration for FO queries over databases with local bounded expansion ... Presented at LICS'10. A glimpse on constant delay enumeration

Enumeration Classes Defined by Circuits - HAL

If we allow a polynomial precomputation step, then we obtain an AC0-delay enumeration algorithm for this problem that uses constant memory.

Shortest distances as enumeration problem - ScienceDirect.com

For APSD enumeration, such strategies, at least at first glance, result in large preprocessing time. ... et al. Constant delay enumeration for ...

Efficient enumeration algorithms for regular document spanners

Note in particular that there is a small distinction between constant delay and output-linear delay: an enumeration algorithm has constant delay if and only if.

On acyclic conjunctive queries and constant delay enumeration

̸= can be performed in polynomial time. Finally, the notion of free-connex treewidth of a structure is defined. We show that for each query of free- ...

Tractable Circuits in Database Theory - SIGMOD Record

Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width. In MFCS, 2019. [32] C. Berkholz and H. Vinall-Smeeth. A ...