Complexity bounds for relational algebra over document spanners
We investigate the complexity of evaluating queries in Relational Algebra (RA) over the relations extracted by regex formulas (i.e., regular expressions with capture variables) over text documents. Such queries, also known as the regular document spanners, were shown to have an evaluation with polyn...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/37692 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|