Constant delay enumeration for conjunctive queries: a tutorial
C Berkholz, F Gerhardt, N Schweikardt - ACM SIGLOG News, 2020 - dl.acm.org
Constant delay enumeration for conjunctive queries Page 1 Constant Delay Enumeration for
Conjunctive Queries — a Tutorial Christoph Berkholz Fabian Gerhardt Nicole Schweikardt …
Conjunctive Queries — a Tutorial Christoph Berkholz Fabian Gerhardt Nicole Schweikardt …
Tractable circuits in database theory
A Amarilli, F Capelli - ACM SIGMOD Record, 2024 - dl.acm.org
This work reviews how database theory uses tractable circuit classes from knowledge
compilation. We present relevant query evaluation tasks, and notions of tractable circuits …
compilation. We present relevant query evaluation tasks, and notions of tractable circuits …
On the enumeration complexity of unions of conjunctive queries
N Carmeli, M Kröll - ACM Transactions on Database Systems (TODS), 2021 - dl.acm.org
We study the enumeration complexity of Unions of Conjunctive Queries (UCQs). We aim to
identify the UCQs that are tractable in the sense that the answer tuples can be enumerated …
identify the UCQs that are tractable in the sense that the answer tuples can be enumerated …
REmatch: a novel regex engine for finding all matches
In this paper, we present the REmatch system for information extraction. REmatch is based
on a recently proposed enumeration algorithm for evaluating regular expressions with …
on a recently proposed enumeration algorithm for evaluating regular expressions with …
Trade-offs in static and dynamic evaluation of hierarchical queries
We investigate trade-offs in static and dynamic evaluation of hierarchical queries with
arbitrary free variables. In the static setting, the trade-off is between the time to partially …
arbitrary free variables. In the static setting, the trade-off is between the time to partially …
Conjunctive queries with self-joins, towards a fine-grained enumeration complexity analysis
N Carmeli, L Segoufin - Proceedings of the 42nd ACM SIGMOD-SIGACT …, 2023 - dl.acm.org
Even though query evaluation is a fundamental task in databases, known classifications of
conjunctive queries by their fine-grained complexity only apply to queries without self-joins …
conjunctive queries by their fine-grained complexity only apply to queries without self-joins …
Enumeration of first-order queries on classes of structures with bounded expansion
W Kazana, L Segoufin - Proceedings of the 32nd ACM SIGMOD-SIGACT …, 2013 - dl.acm.org
We consider the evaluation of first-order queries over classes of databases with bounded
expansion. The notion of bounded expansion is fairly broad and generalizes bounded …
expansion. The notion of bounded expansion is fairly broad and generalizes bounded …
Algorithms and data structures for first-order logic with connectivity under vertex failures
We introduce a new data structure for answering connectivity queries in undirected graphs
subject to batched vertex failures. Precisely, given any graph G and integer k, we can in …
subject to batched vertex failures. Precisely, given any graph G and integer k, we can in …
Twin-width and types
We study problems connected to first-order logic in graphs of bounded twin-width. Inspired
by the approach of Bonnet et al.[FOCS 2020], we introduce a robust methodology of local …
by the approach of Bonnet et al.[FOCS 2020], we introduce a robust methodology of local …
Representing paths in graph database pattern matching
W Martens, M Niewerth, T Popp… - arxiv preprint arxiv …, 2022 - arxiv.org
Modern graph database query languages such as GQL, SQL/PGQ, and their academic
predecessor G-Core promote paths to first-class citizens in the sense that paths that match …
predecessor G-Core promote paths to first-class citizens in the sense that paths that match …