Efficient evaluation for a temporal logic on changing XML documents

Authors:
Mikolaj Bojanczyk;Diego Figueira
Affiliations:
University of Warsaw, Warszawa, Poland;University of Edinburgh, Edinburgh, United Kingdom
Venue:
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2011

Citing 6
Cited 0

Temportal connectives versus explicit timestamps to query temporal databases

Journal of Computer and System Sciences
Efficient Incremental Validation of XML Documents

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Incremental validation of XML documents

ACM Transactions on Database Systems (TODS)
XPath evaluation in linear time

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental XPath evaluation

Proceedings of the 12th International Conference on Database Theory
Automata and logics for words and trees over an infinite alphabet

CSL'06 Proceedings of the 20th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a sequence t1,...,tk of XML documents that is produced by a sequence of local edit operations. To describe properties of such a sequence, we use a temporal logic. The logic can navigate both in time and in the document, e.g. a formula can say that every node with label a eventually gets a descendant with label b. For every fixed formula, we provide an evaluation algorithm that works in time O(k ⋅ log(n)), where k is the number of edit operations and n is the maximal size of document that is produced. In the algorithm, we represent formulas of the logic by a kind of automaton, which works on sequences of documents. The algorithm works on XML documents of bounded depth.