基于分类的源的P2P系统中的查询评估：算法、复杂性和优化
Query Evaluation in P2P Systems of Taxonomy-based Sources: Algorithms, Complexity, and Optimizations
摘要：
在这项研究中，我们解决的问题，回答查询的对等系统的分类为基础的来源。分类法陈述了项的无负DNF公式和项的无负合取之间的包容关系。为了奠定我们研究的基础，我们首先考虑集中的情况下，得出的决策问题和查询评估的复杂性。最后，我们提出了一个算法，是有效的数据的复杂性，是基于超图。更多的表现形式的分类也进行了研究，但导致棘手。然后，我们转移到分布式的情况下，并介绍了一个基于分类的源网络的逻辑模型。在这样的网络上，集中式算法的分布式版本，然后提出的消息传递范式的基础上，并证明其正确性。最后，我们讨论优化问题，并与我们的工作的文献。
英文摘要：
In this study, we address the problem of answering queries over a peer-to-peer system of taxonomy-based sources. A taxonomy states subsumption relationships between negation-free DNF formulas on terms and negation-free conjunctions of terms. To the end of laying the foundations of our study, we first consider the centralized case, deriving the complexity of the decision problem and of query evaluation. We conclude by presenting an algorithm that is efficient in data complexity and is based on hypergraphs. More expressive forms of taxonomies are also investigated, which however lead to intractability. We then move to the distributed case, and introduce a logical model of a network of taxonomy-based sources. On such network, a distributed version of the centralized algorithm is then presented, based on a message passing paradigm, and its correctness is proved. We finally discuss optimization issues, and relate our work to the literature.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
