On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees
Information Processing Letters（2010）
摘要
We consider answering queries over incomplete XML trees. Barcelo et al. identified a class of shallow queries for which the problem is efficiently solvable with node ids on trees while it is coNP-complete without them. We show that their result is essentially tight. In other words, we provide a slightly extended class of queries where node ids help no more.
更多查看译文
关键词
shallow query,node id,incomplete dom-trees,extended class,certain answer,conp hardness,incomplete xml tree,incomplete information,databases
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要