Search

• < Previous
• 1
• Next >

---

The Complexity of Aggregates over Extractions by Regular Expressions

Johannes Doleschal ; Benny Kimelfeld ; Wim Martens.

Regular expressions with capture variables, also known as regex-formulas, extract relations of spans (intervals identified by their start and end indices) from text. In turn, the class of regular document spanners is the closure of the regex formulas under the Relational Algebra. We investigate the&nbsp;[&hellip;]

---

A Trichotomy for Regular Trail Queries

Wim Martens ; Matthias Niewerth ; Tina Popp.

Regular path queries (RPQs) are an essential component of graph query languages. Such queries consider a regular expression r and a directed edge-labeled graph G and search for paths in G for which the sequence of labels is in the language of r. In order to avoid having to consider infinitely many&nbsp;[&hellip;]

---