research-article

MSO queries on trees: enumerating answers under updates

Authors:

Katja Losemann,

Wim MartensAuthors Info & Claims

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)

Article No.: 67, Pages 1 - 10

https://doi.org/10.1145/2603088.2603137

Published: 14 July 2014 Publication History

Abstract

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 uses an O(n) preprocessing phase and enumerates answers with O(log n) delay between them. When the word is updated, the algorithm can avoid repeating expensive preprocessing and restart the enumeration phase within O(log n) time. For trees, our algorithm uses O(n) preprocessing time, enumerates answers with O(log² n) delay, and can restart enumeration within O(log² n) time after receiving an update to the tree. This significantly improves the cost of recomputing the answers of a query from scratch. Our algorithms and complexity results in the paper are presented in terms of node-selecting automata representing the MSO queries.

References

[1]

G. Bagan. MSO queries on tree decomposable structures are computable with linear delay. In Computer Science Logic (CSL), pages 167--181, 2006.

Digital Library

[2]

A. Balmin, Y. Papakonstantinou, and V. Vianu. Incremental validation of XML documents. ACM Transactions on Database Systems (TODS), 29(4):710--751, 2004.

Digital Library

[3]

M. Benedikt and C. Koch. XPath leashed. ACM Computing Surveys (CSUR), 41(1):3:1--3:54, 2009.

Digital Library

[4]

H. Björklund, W. Gelade, and W. Martens. Incremental XPath evaluation. ACM Transactions on Database Systems (TODS), 35(4):29:1--29:43, 2010.

Digital Library

[5]

M. Bojanczyk and D. Figueira. Efficient evaluation for a temporal logic on changing XML documents. In Symposium on Principles of Database Systems (PODS), pages 259--270, 2011.

Digital Library

[6]

T. Colcombet. A combinatorial theorem for trees. In International Colloquium on Automata, Languages and Programming (ICALP), pages 901--912, 2007.

Digital Library

[7]

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

Digital Library

[8]

A. Durand and Y. Strozecki. Enumeration complexity of logical query problems with second-order variables. In Computer Science Logic (CSL), pages 189--202, 2011.

[9]

M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic, 130(1--3):3--31, 2004.

[10]

M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees (extended abstract). In Logic in Computer Science (LICS), page 188, 2003.

Digital Library

[11]

D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing (SICOMP), 13(2):338--355, 1984.

Digital Library

[12]

W. Kazana and L. Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. In Symposium on Principles of Database Systems (PODS), pages 297--308, 2013.

Digital Library

[13]

W. Kazana and L. Segoufin. Enumeration of monadic second-order queries on trees. ACM Transactions on Computational Logic (TOCL), 14(4):25:1--25:12, 2013.

Digital Library

[14]

F. Neven. Design and Analysis of Query Languages for Structured Documents. PhD thesis, Limburgs Universitair Centrum, 1999.

[15]

J. Niehren, L. Planque, J.-M. Talbot, and S. Tison. N-ary queries by tree automata. In International Conference on Database Programming Languages (DBPL), pages 217--231, 2005.

Digital Library

[16]

S. Patnaik and N. Immerman. Dyn-FO: A parallel, dynamic complexity class. Journal of Computer and System Sciences (JCSS), 55(2):199--209, 1997.

Digital Library

[17]

L. Segoufin. Enumerating with constant delay the answers to a query. In International Conference on Database Theory (ICDT), pages 10--20, 2013.

Digital Library

[18]

I. Simon. Factorization forests of finite height. Theoretical Computer Science (TCS), 72(1):65--94, 1990.

Digital Library

[19]

D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences (JCSS), 26(3):362--391, 1983.

Digital Library

[20]

J. W. Thatcher and J. B. Wright. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57--82, 1968.

Cited By

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
Tao YYi K(2021)Intersection Joins under UpdatesJournal of Computer and System Sciences10.1016/j.jcss.2021.09.004Online publication date: Sep-2021
https://doi.org/10.1016/j.jcss.2021.09.004
Show More Cited By

Index Terms

MSO queries on trees: enumerating answers under updates
1. Information systems
  1. Information systems applications
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 ...
Queries on Xml streams with bounded delay and concurrency

Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query are two measures for the degree of their streamability. They count the ...
Filtering unsatisfiable XPath queries

The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submission and the computation of unsatisfiable queries. Thus, applying the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

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)

July 2014

764 pages

ISBN:9781450328869

DOI:10.1145/2603088

Program Chairs:
Thomas Henzinger
Institute of Science and Technology (IST), Austria
,
Dale Miller
INRIA and LIX/Ecole Polytechnique, Palaiseau

Copyright © 2014 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

SIGLOG: ACM Special Interest Group on Logic and Computation
EACSL: European Association for Computer Science Logic
IEEE-CS\DATC: IEEE Computer Society

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 July 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CSL-LICS '14

Sponsor:

SIGLOG
EACSL
IEEE-CS\DATC

CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC

July 14 - 18, 2014

Vienna, Austria

Acceptance Rates

CSL-LICS '14 Paper Acceptance Rate 74 of 212 submissions, 35%;

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
132
Total Downloads

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

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

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
Tao YYi K(2021)Intersection Joins under UpdatesJournal of Computer and System Sciences10.1016/j.jcss.2021.09.004Online publication date: Sep-2021
https://doi.org/10.1016/j.jcss.2021.09.004
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
Berkholz CGerhardt FSchweikardt N(2020)Constant delay enumeration for conjunctive queriesACM SIGLOG News10.1145/3385634.33856367:1(4-33)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3385634.3385636
Amarilli ABourhis PMengel SNiewerth MSuciu DSkritek SKoch C(2019)Enumeration on Trees with Tractable Combined Complexity and Efficient UpdatesProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319702(89-103)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319702
Niewerth M(2018)MSO Queries on TreesProceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3209108.3209144(769-778)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1145/3209108.3209144
Niewerth MSegoufin LVan den Bussche JArenas M(2018)Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic UpdatesProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196961(179-191)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196961
Berkholz CKeppeler JSchweikardt NSallinger EVan den Bussche JGeerts F(2017)Answering Conjunctive Queries under UpdatesProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3034789(303-318)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3034786.3034789

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