License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2019.13
URL: http://drops.dagstuhl.de/opus/volltexte/2019/10315/
Go to the corresponding LIPIcs Volume Portal


Peterfreund, Liat ; Cate, Balder ten ; Fagin, Ronald ; Kimelfeld, Benny

Recursive Programs for Document Spanners

pdf-format:
LIPIcs-ICDT-2019-13.pdf (0.6 MB)


Abstract

A document spanner models a program for Information Extraction (IE) as a function that takes as input a text document (string over a finite alphabet) and produces a relation of spans (intervals in the document) over a predefined schema. A well-studied language for expressing spanners is that of the regular spanners: relational algebra over regex formulas, which are regular expressions with capture variables. Equivalently, the regular spanners are the ones expressible in non-recursive Datalog over regex formulas (which extract relations that constitute the extensional database). This paper explores the expressive power of recursive Datalog over regex formulas. We show that such programs can express precisely the document spanners computable in polynomial time. We compare this expressiveness to known formalisms such as the closure of regex formulas under the relational algebra and string equality. Finally, we extend our study to a recently proposed framework that generalizes both the relational model and the document spanners.

BibTeX - Entry

@InProceedings{peterfreund_et_al:LIPIcs:2019:10315,
  author =	{Liat Peterfreund and Balder ten Cate and Ronald Fagin and Benny Kimelfeld},
  title =	{{Recursive Programs for Document Spanners}},
  booktitle =	{22nd International Conference on Database Theory (ICDT 2019)},
  pages =	{13:1--13:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-101-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{127},
  editor =	{Pablo Barcelo and Marco Calautti},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10315},
  doi =		{10.4230/LIPIcs.ICDT.2019.13},
  annote =	{Keywords: Information Extraction, Document Spanners, Polynomial Time, Recursion, Regular Expressions, Datalog}
}

Keywords: Information Extraction, Document Spanners, Polynomial Time, Recursion, Regular Expressions, Datalog
Seminar: 22nd International Conference on Database Theory (ICDT 2019)
Issue Date: 2019
Date of publication: 19.03.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI