5 citations · 5 across the 3 of their papers we have counts for
4 papers
FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
Markus Lohrey, Sebastian Maneth, Markus L. Schmid
Enumerating the result set of a first-order query over a relational structure of bounded degree can be done with linear preprocessing and constant delay. In this work, we extend th…
A framework for extraction and transformation of documents
Cristian Riveros, Markus L. Schmid, Nicole Schweikardt
We present a theoretical framework for the extraction and transformation of text documents. We propose to use a two-phase process where the first phase extracts span-tuples from a…
MSO-Enumeration Over SLP-Compressed Unranked Forests
Markus Lohrey, Markus L. Schmid
We study the problem of enumerating the answers to a query formulated in monadic second order logic (MSO) over an unranked forest F that is compressed by a straight-line program (S…
Fine-Grained Complexity of Regular Path Queries
Katrin Casel, Markus L. Schmid
A regular path query (RPQ) is a regular expression q that returns all node pairs (u, v) from a graph database that are connected by an arbitrary path labelled with a word from L(q)…