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 …
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 …
A purely regular approach to non-regular core spanners
ML Schmid, N Schweikardt - 24th International Conference on …, 2021 - drops.dagstuhl.de
The regular spanners (characterised by vset-automata) are closed under the algebraic
operations of union, join and projection, and have desirable algorithmic properties. The core …
operations of union, join and projection, and have desirable algorithmic properties. The core …
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 …
CORE: a complex event recognition engine
M Bucchi, A Grez, A Quintana, C Riveros… - arxiv preprint arxiv …, 2021 - arxiv.org
Complex Event Recognition (CER) systems are a prominent technology for finding user-
defined query patterns over large data streams in real time. CER query evaluation is known …
defined query patterns over large data streams in real time. CER query evaluation is known …
Efficient logspace classes for enumeration, counting, and uniform generation
In this work, we study two simple yet general complexity classes, based on logspace Turing
machines, which provide a unifying framework for efficient query evaluation in areas like …
machines, which provide a unifying framework for efficient query evaluation in areas like …
Efficient enumeration algorithms for regular document spanners
F Florenzano, C Riveros, M Ugarte… - ACM Transactions on …, 2020 - dl.acm.org
Regular expressions and automata models with capture variables are core tools in rule-
based information extraction. These formalisms, also called regular document spanners, use …
based information extraction. These formalisms, also called regular document spanners, use …
Spanner evaluation over SLP-compressed documents
ML Schmid, N Schweikardt - Proceedings of the 40th ACM SIGMOD …, 2021 - dl.acm.org
We consider the problem of evaluating regular spanners over compressed documents, ie,
we wish to solve evaluation tasks directly on the compressed data, without decompression …
we wish to solve evaluation tasks directly on the compressed data, without decompression …