Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2014.279
URN: urn:nbn:de:0030-drops-48496
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4849/
David, Claire ; Francis, Nadime ; Murlak, Filip
Consistency of Injective Tree Patterns
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{david_et_al:LIPIcs:2014:4849,
author = {Claire David and Nadime Francis and Filip Murlak},
title = {{Consistency of Injective Tree Patterns}},
booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
pages = {279--290},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-77-4},
ISSN = {1868-8969},
year = {2014},
volume = {29},
editor = {Venkatesh Raman and S. P. Suresh},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4849},
URN = {urn:nbn:de:0030-drops-48496},
doi = {10.4230/LIPIcs.FSTTCS.2014.279},
annote = {Keywords: XML, incomplete information, injective tree patterns, consistency}
}
| Keywords: | XML, incomplete information, injective tree patterns, consistency | |
| Seminar: | 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014) | |
| Issue date: | 2014 | |
| Date of publication: | 12.12.2014 |
