文章基本信息

标题：Consistency of Injective Tree Patterns
本地全文：下载
作者：Claire David ; Nadime Francis ; Filip Murlak 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2014
卷号：29
页码：279-290
DOI：10.4230/LIPIcs.FSTTCS.2014.279
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Testing if an incomplete description of an XML document is consistent, that is, if it describes a real document conforming to the imposed schema, amounts to deciding if a given tree pattern can be matched injectively into a tree accepted by a fixed automaton. This problem can be solved in polynomial time for patterns that use the child relation and the sibling order, but do not use the descendant relation. For general patterns the problem is in NP, but no lower bound has been known so far. We show that the problem is NP-complete already for patterns using only child and descendant relations. The source of hardness turns out to be the interplay between these relations: for patterns using only descendant we give a polynomial algorithm. We also show that the algorithm can be adapted to patterns using descendant and following-sibling, but combining descendant and next-sibling leads to intractability.
关键词：XML; incomplete information; injective tree patterns; consistency