Probabilistic XML via Markov Chains - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Probabilistic XML via Markov Chains

Michael Benedikt
  • Fonction : Auteur
  • PersonId : 882923
Dan Olteanu
  • Fonction : Auteur
  • PersonId : 882924
Evgeny Kharlamov
  • Fonction : Auteur
  • PersonId : 882894
Pierre Senellart

Résumé

We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. We show that RMCs subsume several existing probabilistic XML models. In contrast to the latter, RMC models (i) capture probabilistic versions of XML schema languages such as DTDs, (ii) can be exponentially more succinct, and (iii) do not restrict the domain of probability distributions to be finite. We investigate RMC models for which tractability can be achieved, and identify several tractable fragments that subsume known tractable probabilistic XML models. We then look at the space of models between existing probabilistic XML formalisms and RMCs, giving results on the expressiveness and succinctness of RMC subclasses, both with each other and with prior formalisms.
Fichier principal
Vignette du fichier
main.pdf (260.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00537778 , version 1 (19-11-2010)

Identifiants

  • HAL Id : hal-00537778 , version 1

Citer

Michael Benedikt, Dan Olteanu, Evgeny Kharlamov, Pierre Senellart. Probabilistic XML via Markov Chains. International Conference on Very Large Data Bases (VLDB), 2010, Singapore. pp.770-781. ⟨hal-00537778⟩
69 Consultations
88 Téléchargements

Partager

Gmail Facebook X LinkedIn More