Yuri Kosharovsky

Learn More
Query evaluation over probabilistic XML is explored. The queries are twig patterns with projection, and the data is represented in terms of three models of probabilistic XML (that extend existing ones in the literature). The first model makes an assumption of independence among the probabilistic junctions, whereas the second model can encode probabilistic(More)
Various known models of probabilistic XML can be represented as instantiations of abstract <i>p-documents</i>. Such documents have, in addition to ordinary nodes, <i>distributional</i> nodes that specify the probabilistic process of generating a random document. Within this abstraction, families of pdocuments, which are natural extensions and combinations(More)
  • 1