Possibility for Probabilistic XML

Abstract :

We consider the possibility problem of determining if a document is a possible world of a probabilistic document, in the setting of probabilistic XML. This basic question is a special case of query answering or tree automata evaluation, but it has specific practical uses, such as checking whether an user-provided probabilistic document outcome is possible or sufficiently likely. In this paper, we study the complexity of the possibility problem for probabilistic XML models of varying expressiveness. We show that the decision problem is often tractable in the absence of long-distance dependencies, but that its computation variant is intractable on unordered documents. We also introduce an explicit matches variant to generalize practical situations where node labels are unambiguous; this ensures tractability of the possibility problem, even under long-distance dependencies, provided event conjunctions are disallowed. Our results entirely classify the tractability boundary over all considered problem variants.

Document type :
Journal articles
Complete list of metadatas

https://hal-imt.archives-ouvertes.fr/hal-01336826
Contributor : Admin Télécom Paristech <>
Submitted on : Thursday, June 23, 2016 - 8:55:00 PM
Last modification on : Monday, March 25, 2019 - 5:18:07 PM

Identifiers

  • HAL Id : hal-01336826, version 1

Citation

Antoine Amarilli. Possibility for Probabilistic XML. Ingéniérie des Systèmes d'Information, Lavoisier, 2015, 20 (5), pp.53-75. ⟨hal-01336826⟩

Share

Metrics

Record views

123