research-article

Constant Delay Algorithms for Regular Document Spanners

Authors:

Fernando Florenzano,

Cristian Riveros,

Stijn Vansummeren,

Domagoj VrgocAuthors Info & Claims

SIGMOD/PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Pages 165 - 177

https://doi.org/10.1145/3196959.3196987

Published: 27 May 2018 Publication History

Abstract

Regular expressions and automata models with capture variables are core tools in rule-based information extraction. These formalisms, also called regular document spanners, use regular languages in order to locate the data that a user wants to extract from a text document, and then store this data into variables. Since document spanners can easily generate large outputs, it is important to have good evaluation algorithms that can generate the extracted data in a quick succession, and with relatively little precomputation time. Towards this goal, we present a practical evaluation algorithm that allows constant delay enumeration of a spanner's output after a precomputation phase that is linear in the document. While the algorithm assumes that the spanner is specified in a syntactic variant of variable set automata, we also study how it can be applied when the spanner is specified by general variable set automata, regex formulas, or spanner algebras. Finally, we study the related problem of counting the number of outputs of a document spanner, providing a fine grained analysis of the classes of document spanners that support efficient enumeration of their results.

References

[1]

Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.

Digital Library

[2]

Carme Álvarez and Birgit Jenner. 1993. A very hard log-space counting class. Theoretical Computer Science 107, 1 (1993), 3--30.

Digital Library

[3]

Marcelo Arenas, Francisco Maturana, Cristian Riveros, and Domagoj Vrgoč. 2016. A Framework for Annotating CSV-like Data. Proc. VLDB Endow. 9, 11 (July 2016), 876--887.

Digital Library

[4]

Guillaume Bagan. 2006. MSO queries on tree decomposable structures are computable with linear delay. In CSL, Vol. 4207. Springer, 167--181.

Digital Library

[5]

Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Proc. of CSL. 208--222.

Digital Library

[6]

Laura Chiticariu, Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghavan, Frederick Reiss, and Shivakumar Vaithyanathan. 2010. SystemT: An Algebraic Approach to Declarative Information Extraction. In ACL 2010, Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, July 11--16, 2010, Uppsala, Sweden. 128--137.

Digital Library

[7]

Laura Chiticariu, Yunyao Li, and Frederick R. Reiss. 2013. Rule-Based Information Extraction is Dead! Long Live Rule-Based Information Extraction Systems!. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013. 827--832.

[8]

Bruno Courcelle. 2009. Linear delay enumeration and monadic second-order logic. Discrete Applied Mathematics 157, 12 (2009), 2675--2700.

Digital Library

[9]

Ronald Fagin, Benny Kimelfeld, Frederick Reiss, and Stijn Vansummeren. 2015. Document Spanners: A Formal Approach to Information Extraction. Journal of the ACM 62, 2 (2015).

Digital Library

[10]

Ronald Fagin, Benny Kimelfeld, Frederick Reiss, and Stijn Vansummeren. 2016. Declarative Cleaning of Inconsistencies in Information Extraction. ACM Trans. Database Syst. 41, 1 (2016), 6:1--6:44.

Digital Library

[11]

Dominik D. Freydenberger. 2017. A Logic for Document Spanners. In 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy. 13:1--13:18.

[12]

Dominik D Freydenberger and Mario Holldack. 2016. Document Spanners: From Expressive Power to Decision Problems. In LIPIcs-Leibniz International Proceedings in Informatics, Vol. 48. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

[13]

Dominik D. Freydenberger, Benny Kimelfeld, and Liat Peterfreund. 2018. Joining Extractions of Regular Expressions. PODS 2018 (to appear) (2018).

Digital Library

[14]

Wojciech Kazana and Luc Segoufin. 2013. Enumeration of monadic second-order queries on trees. ACM Transactions on Computational Logic (TOCL) 14, 4 (2013), 25.

Digital Library

[15]

Benny Kimelfeld. 2014. Database principles in information extraction. In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22--27, 2014. 156--163.

Digital Library

[16]

Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghavan, Frederick Reiss, Shivakumar Vaithyanathan, and Huaiyu Zhu. 2008. SystemT: a system for declarative information extraction. SIGMOD Record 37, 4 (2008), 7--13.

Digital Library

[17]

Francisco Maturana, Cristian Riveros, and Domagoj Vrgoč. 2018. Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity. PODS 2018 (to appear) (2018).

Digital Library

[18]

Andrea Morciano, Martín Ugarte, and Stijn Vansummeren. 2016. Automata-based evaluation of AQL queries. Technical report, Université Libre de Bruxelles (2016).

[19]

Luc Segoufin. 2013. Enumerating with constant delay the answers to a query. In Joint 2013 EDBT/ICDT Conferences, ICDT '13 Proceedings, Genoa, Italy, March 18--22, 2013. 10--20.

Digital Library

[20]

Luc Segoufin. 2014. A glimpse on constant delay enumeration. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5--8, 2014, Lyon, France. 13--27.

[21]

Luc Segoufin. 2015. Constant Delay Enumeration for Conjunctive Queries. SIG-MOD Record 44, 1 (2015), 10--17.

Digital Library

[22]

Warren Shen, AnHai Doan, Jeffrey F. Naughton, and Raghu Ramakrishnan. 2007. Declarative Information Extraction Using Datalog with Embedded Extraction Predicates. In Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, September 23--27, 2007. 1033--1044.

Digital Library

[23]

Leslie G Valiant. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3 (1979), 410--421.

Digital Library

Cited By

Jin CXu YSaha BServedio R(2023)Removing Additive Structure in 3SUM-Based ReductionsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585157(405-418)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585157
Abboud ABringmann KKhoury SZamir OLeonardi SGupta A(2022)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyondProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520066(1487-1500)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520066
Doleschal JKimelfeld BMartens W(2021)Database Principles and Challenges in Text AnalysisACM SIGMOD Record10.1145/3484622.348462450:2(6-17)Online publication date: 31-Aug-2021
https://dl.acm.org/doi/10.1145/3484622.3484624
Show More Cited By

Index Terms

Constant Delay Algorithms for Regular Document Spanners
1. Information systems
2. Theory of computation

Recommendations

Document Spanners: A Formal Approach to Information Extraction

An intrinsic part of information extraction is the creation and manipulation of relations extracted from text. In this article, we develop a foundational framework where the central construct is what we call a document spanner (or just spanner for short)...
Efficient Enumeration Algorithms for Regular Document Spanners
Best of SIGMOD 2018 and Best of PODS 2018

Regular expressions and automata models with capture variables are core tools in rule-based information extraction. These formalisms, also called regular document spanners, use regular languages to locate the data that a user wants to extract from a ...
Document Spanners: From Expressive Power to Decision Problems

We examine document spanners, a formal framework for information extraction that was introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (PODS 2013, JACM 2015). A document spanner is a function that maps an input string to a relation over spans (...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

May 2018

462 pages

ISBN:9781450347068

DOI:10.1145/3196959

General Chair:
Jan Van den Bussche
Hasselt University
,
Program Chair:
Marcelo Arenas
Pontificia Universidad Católica de Chile

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 May 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

SIGMOD/PODS '18

Sponsor:

SIGMOD

SIGMOD/PODS '18: International Conference on Management of Data

June 10 - 15, 2018

TX, Houston, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
193
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)3

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jin CXu YSaha BServedio R(2023)Removing Additive Structure in 3SUM-Based ReductionsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585157(405-418)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585157
Abboud ABringmann KKhoury SZamir OLeonardi SGupta A(2022)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyondProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520066(1487-1500)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3520066
Doleschal JKimelfeld BMartens W(2021)Database Principles and Challenges in Text AnalysisACM SIGMOD Record10.1145/3484622.348462450:2(6-17)Online publication date: 31-Aug-2021
https://dl.acm.org/doi/10.1145/3484622.3484624
Carmeli NKröll M(2021)On the Enumeration Complexity of Unions of Conjunctive QueriesACM Transactions on Database Systems10.1145/345026346:2(1-41)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3450263
Amarilli ABourhis PMengel SNiewerth M(2021)Constant-Delay Enumeration for Nondeterministic Document SpannersACM Transactions on Database Systems10.1145/343648746:1(1-30)Online publication date: 14-Apr-2021
https://dl.acm.org/doi/10.1145/3436487
Amarilli ABourhis PMengel SNiewerth M(2020)Constant-Delay Enumeration for Nondeterministic Document SpannersACM SIGMOD Record10.1145/3422648.342265549:1(25-32)Online publication date: 4-Sep-2020
https://dl.acm.org/doi/10.1145/3422648.3422655
Kimelfeld B(2020)Technical PerspectiveACM SIGMOD Record10.1145/3422648.342265449:1(24-24)Online publication date: 4-Sep-2020
https://dl.acm.org/doi/10.1145/3422648.3422654
Florenzano FRiveros CUgarte MVansummeren SVrgoč D(2020)Efficient Enumeration Algorithms for Regular Document SpannersACM Transactions on Database Systems10.1145/335145145:1(1-42)Online publication date: 8-Feb-2020
https://dl.acm.org/doi/10.1145/3351451
Martens W(2020)Formal Languages in Information Extraction and Graph DatabasesBeyond the Horizon of Computability10.1007/978-3-030-51466-2_28(306-309)Online publication date: 24-Jun-2020
https://doi.org/10.1007/978-3-030-51466-2_28
Arenas MCroquevielle LJayaram RRiveros CSuciu DSkritek SKoch C(2019)Efficient Logspace Classes for Enumeration, Counting, and Uniform GenerationProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319704(59-73)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319704
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents