DMCA
Finite Implication of Keys and Foreign Keys for XML Data (2000)
| Citations: | 3 - 3 self |
BibTeX
@TECHREPORT{Fan00finiteimplication,
author = {Wenfei Fan and Leonid Libkin},
title = {Finite Implication of Keys and Foreign Keys for XML Data},
institution = {},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We investigate finite implication problems associated with key and foreign key constraints for XML data. We demonstrate that there is interaction between DTDs and these constraints, and the interaction complicates the analysis of finite implication. In particular, we establish complexity results for reasoning about two classes of constraints for XML. One class, L u , defines unary keys and foreign keys, and the other, L, consists of multi-attribute keys and foreign keys. We show that the finite implication problem for L u constraints is coNP-complete, and the finite implication problem for L constraints is undecidable. We also identify several PTIME decidable cases of the finite implication problems. In addition, we improve the results established in [16] by showing that the finite satisfiability problem for unary keys, unary inclusion constraints and their negations is NP-complete.
