research-article

Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates

Authors:

Matthias Niewerth,

Luc SegoufinAuthors Info & Claims

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

Pages 179 - 191

https://doi.org/10.1145/3196959.3196961

Published: 27 May 2018 Publication History

Abstract

We consider the enumeration of MSO queries over strings under updates. For each MSO query we build an index structure enjoying the following properties: The index structure can be constructed in linear time, it can be updated in logarithmic time and it allows for constant delay time enumeration. This improves from the previous known index structures allowing for constant delay enumeration that would need to be reconstructed from scratch, hence in linear time, in the presence of updates. We allow relabeling updates, insertion of individual labels and removal of individual labels.

References

[1]

Georgy Adelson-Velsky and Evgenii Landis. 1962. An Algorithm for the Organization of Information. Doklady Akademii Nauk USSR 146, 2 (1962), 263--266.

[2]

Antoine Amarilli, Pierre Bourhis, and Stefan Mengel. 2018. Enumeration on Trees under Relabelings. In Intl. Conf. on Database Theory (ICDT). 5:1--5:18.

[3]

Mustapha Arfi. 1987. Polynomial Operations on Rational Languages. In Symp. on Theoretical Aspects of Computer Science (STACS). 198--206.

Digital Library

[4]

Guillaume Bagan. 2006. MSO queries on tree decomposable structures are computable with linear delay. In Proc. 20th International Workshop/15th Annual Conference of the EACSL (CSL'06). 167--181.

Digital Library

[5]

Andrey Balmin, Yannis Papakonstantinou, and Victor Vianu. 2004. Incremental validation of XML documents. ACM Trans. Database Syst. 29, 4 (2004), 710--751.

Digital Library

[6]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017. Answering Conjunctive Queries under Updates. In Symp. on Principles of Database Systems (PODS).

Digital Library

[7]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017. Answering FO+MOD Queries Under Updates on Bounded Degree Databases. In Intl. Conf. on Database Theory (ICDT).

[8]

Mikołaj Bojańczyk and Pawel Parys. 2011. XPath evaluation in linear time. J. ACM 58, 4 (2011), 17.

Digital Library

[9]

Mikołaj Bojańczyk, Howard Straubing, and Igor Walukiewicz. 2012. Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science 8, 3 (2012).

[10]

Thomas Colcombet. 2007. A Combinatorial Theorem for Trees. In Intl Conf. on Automata and Logic Programming (ICALP). 901--912.

Digital Library

[11]

Arnaud Durand and Etienne Grandjean. 2007. First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logic 8, 4 (2007).

Digital Library

[12]

Arnaud Durand, Nicole Schweikardt, and Luc Segoufin. 2014. Enumerating answers to first-order queries over databases of low degree. In Principles of Database Systems (PODS'14).

Digital Library

[13]

Wojciech Kazana. 2013. Query evaluation with constant delay. Ph.D. Dissertation. ENS Cachan.

[14]

Wojciech Kazana and Luc Segoufin. 2011. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science 7, 2 (2011).

[15]

Wojciech Kazana and Luc Segoufin. 2013. Enumeration of first-order queries on classes of structures with bounded expansion. In Proc. 32nd ACM Symposium on Principles of Database Systems (PODS'13). 297--308.

Digital Library

[16]

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

Digital Library

[17]

Kenneth Krohn and John Rhodes. 1965. Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines. Trans. Amer. Math. Soc. 116 (1965), 450--464.

[18]

Katja Losemann and Wim Martens. 2014. MSO queries on trees: enumerating answers under updates. In Computer Science Logic and Logic in Computer Science (CSL-LICS'14).

Digital Library

[19]

Oded Maler. 2010. On the Krohn-Rhodes Cascaded Decomposition Theorem. In Time for Verification, Essays in Memory of Amir Pnueli. 260--278.

Digital Library

[20]

Matthias Niewerth. 2018. MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras. submitted.

[21]

Wolfgang Thomas. 1982. Classifying Regular Events in Symbolic Logic. 25, 3 (1982), 360--376.

Cited By

Lopez TMonmege BTalbot J(2025)Regular D-lengthInformation Processing Letters10.1016/j.ipl.2024.106497187:COnline publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1016/j.ipl.2024.106497
Schweikardt NSegoufin LVigny A(2022)Enumeration for FO Queries over Nowhere Dense GraphsJournal of the ACM10.1145/351703569:3(1-37)Online publication date: 11-Jun-2022
https://dl.acm.org/doi/10.1145/3517035
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

Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Enumeration
2. Theory of computation

Recommendations

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

We investigate efficient enumeration of answers to MSO-definable queries over trees which are subject to local updates. We exhibit an algorithm that uses an O(n) preprocessing phase and enumerates answers with O(log(n)) delay between them. When the tree ...
MSO queries on trees: enumerating answers under updates
CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

We investigate efficient view maintenance for MSO-definable queries over trees or, more precisely, efficient enumeration of answers to MSO-definable queries over words and trees which are subject to local updates. For words we exhibit an algorithm that ...
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07: Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

We study the enumeration complexity of the natural extension of acyclic conjunctive queries with disequalities. In this language, a number of NP-complete problems can be expressed. We first improve a previous result of Papadimitriou and Yannakakis by ...

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

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

24
Total Citations
View Citations
143
Total Downloads

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

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lopez TMonmege BTalbot J(2025)Regular D-lengthInformation Processing Letters10.1016/j.ipl.2024.106497187:COnline publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1016/j.ipl.2024.106497
Schweikardt NSegoufin LVigny A(2022)Enumeration for FO Queries over Nowhere Dense GraphsJournal of the ACM10.1145/351703569:3(1-37)Online publication date: 11-Jun-2022
https://dl.acm.org/doi/10.1145/3517035
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
Berkholz CMerz MLibkin LPichler RGuagliardo P(2021)Probabilistic Databases under UpdatesProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458326(402-415)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458326
Liu ZKettimuthu RChung JAnanthakrishnan RLink MFoster I(2021)Design and Evaluation of a Simple Data Interface for Efficient Data Transfer across Diverse StorageACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/34520076:1(1-25)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3452007
Domingues GMendonça GSilva ELeão RMenasché DRottenstreich ODehghan MTowsley D(2021)The Role of Hysteresis in Caching SystemsACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/34505646:1(1-38)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3450564
Wei ZLink S(2021)Embedded Functional Dependencies and Data-completeness Tailored Database DesignACM Transactions on Database Systems10.1145/345051846:2(1-46)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3450518
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
Liu BHe XSong MLi JQu GLang JGu R(2021)A Method for Mining Granger Causality Relationship on Atmospheric VisibilityACM Transactions on Knowledge Discovery from Data10.1145/344768115:5(1-16)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3447681
BlečIć ICuccu SFanni FFrau VMacis RSaiu VSenis MSpano LTola A(2021)First-person Cinematographic VideogamesJournal on Computing and Cultural Heritage 10.1145/344697714:2(1-29)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3446977
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