Efficient evaluation for a temporal logic on changing XML documents - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Efficient evaluation for a temporal logic on changing XML documents

Résumé

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.
Fichier principal
Vignette du fichier
hal.pdf (331.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01803459 , version 1 (12-06-2018)

Identifiants

Citer

Mikołaj Bojańczyk, Diego Figueira. Efficient evaluation for a temporal logic on changing XML documents. ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), Jun 2011, Athens, Greece. ⟨10.1145/1989284.1989317⟩. ⟨hal-01803459⟩
27 Consultations
73 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More