Conjunctive query containment over trees
Conjunctive query containment over trees
复制标题
树上的联合查询包含
DOI：
10.1016/j.jcss.2010.04.005
复制
发表时间：
2007
影响因子：
4.8
通讯作者：
T. Schwentick
中科院分区：
文献类型：
--
作者：
Henrik Björklund;W. Martens;T. Schwentick
有限的，排名，标记树的合取查询的包容性和可满足性的复杂性进行了研究相对于轴的儿童，NextSibling，他们的传递和自反闭包，以下。对于包含问题，提出了一种可分性，将问题分类为PTIME，CONP-完全或CONP 2 P-完全。对于可满足性问题，大多数问题被归类为PTIME或NP完全问题。
The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, their transitive and reflexive closures, and Following. For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or Π2P-complete. For the satisfiability problem most problems are classified as either in PTIME or NP-complete.