On the complexity of managing probabilistic XML data
On the complexity of managing probabilistic XML data
复制标题
DOI：
10.1145/1265530.1265570
复制
发表时间：
2007-06
期刊：
影响因子：
--
通讯作者：
P. Senellart;Serge Abiteboul
中科院分区：
文献类型：
--
作者：
P. Senellart;Serge Abiteboul
在[3]中，我们介绍了一个框架，用于查询和更新概率的树模型，以查询和更新概率信息。数据模型基于树的树木，并用概率事件变量的结合注释节点。我们简要描述了用法的实现和方案。我们在这里为该模型建立了数学基础。特别是，我们提出复杂性结果。我们确定了一个非常大的查询，从[3]中简单地查询和更新算法的简单变化计算了正确的答案。主要贡献是对查询和更新的完整复杂性分析。我们还展示了概率树的等效性的决策程序，并证明它在共同体中。此外，我们研究了消除可能可能可能发生的世界的问题，以及验证概率树针对DTD的问题。我们表明，这两个问题在最普遍的情况下是棘手的。
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees where nodes are annotated with conjunctions of probabilistic event variables. We briefly described an implementation and scenarios of usage. We develop here a mathematical foundation for this model. In particular, we present complexity results. We identify a very large class of queries for which simple variations of querying and updating algorithms from [3] compute the correct answer. A main contribution is a full complexity analysis of queries and updates. We also exhibit a decision procedure for the equivalence of probabilistic trees and prove it is in co-RP. Furthermore, we study the issue of removing less probable possible worlds, and that of validating a probabilistic tree against a DTD. We show that these two problems are intractable in the most general case.