PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
XKvalidator: a constraint validator for XML
Proceedings of the eleventh international conference on Information and knowledge management
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Information Systems
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
A Trace Semantics for Positive Core XPath
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Efficient discovery of XML data redundancies
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Updates and views dependencies in semi-structured databases
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
A comparative study of functional dependencies for XML
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
ICDT'07 Proceedings of the 11th international conference on Database Theory
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
XML materialized views and schema evolution in VIREX
Information Sciences: an International Journal
Attribute grammar for XML integrity constraint validation
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Hi-index | 0.00 |
Given an XML functional dependency fd and a class of updates U, we say that fd is independent with respect to U if and only if any XML document satisfies fd after any update q of U, as soon as it did it before q. In this paper we study the following problem: is it possible to detect if an XML functional dependency fd is independent with respect to a class of updates U? We address this problem when the functional dependency and the class of updates are specified with a same formalism: the regular tree patterns. We first show that the use of regular tree patterns federates most of the known approaches for expressing XML functional dependencies while allowing to capture some of constraints not so far expressible. Then we show that in general the addressed problem is PSPACE-hard, but we exhibit a sufficient condition testable in polynomial time ensuring the independence of a functional dependency with respect to a class of updates.