Reasoning about XML update constraints

We introduce in this paper a class of constraints for describing howan XML document can evolve, namely XML update constraints. For these constraints, we study the implication problem, giving algorithms and complexity results for constraints of varying expressive power. Besides classical constraint implication, we also consider an instance-based approach. More precisely, we study implication with respect to a current tree instance, resulting from a series of unknown updates. The main motivation of our work is reasoning about data integrity under update restrictions in contexts where owners may lose control over their data, such as in publishing or exchange.

[1]  Yannis Papakonstantinou,et al.  DTD inference for views of XML data , 2000, PODS.

[2]  Marcelo Arenas,et al.  XML data exchange: consistency and query answering , 2005, PODS '05.

[3]  Victor Vianu.  Dynamic constraints and database evolution , 1983, PODS '83.

[4]  Michael Gertz,et al.  Authentic Third-party Data Publication , 2000, DBSec.

[5]  Wenfei Fan,et al.  XML constraints: specification, analysis, and applications , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[6]  Mihir Bellare,et al.  Incremental Cryptography: The Case of Hashing and Signing , 1994, CRYPTO.

[7]  Wenfei Fan,et al.  Integrity constraints for XML , 2000, PODS.

[8]  Silvio Micali,et al.  Transitive Signature Schemes , 2002, CT-RSA.

[9]  Dan Suciu,et al.  Modeling Integrity in Data Exchange , 2004, Secure Data Management.

[10]  Dan Suciu,et al.  Processing XML streams with deterministic automata and stream indexes , 2004, TODS.

[11]  Wenfei Fan,et al.  On XML integrity constraints in the presence of DTDs , 2001, JACM.

[12]  Thomas Schwentick,et al.  XPath query containment , 2004, SGMD.

[13]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[14]  Michael Benedikt,et al.  XPath leashed , 2009, CSUR.

[15]  Wenfei Fan,et al.  Consistency of XML Specifications , 2005, Inconsistency Tolerance.

[16]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[17]  Rajeev Rastogi,et al.  Tree Pattern Aggregation for Scalable XML Data Dissemination , 2002, VLDB.

[18]  Dan Suciu,et al.  Containment and equivalence for a fragment of XPath , 2004, JACM.

[19]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, J. Comput. Syst. Sci..

[20]  Thomas Schwentick,et al.  On the complexity of XPath containment in the presence of disjunction, DTDs, and variables , 2006, Log. Methods Comput. Sci..

[21]  Georg Gottlob,et al.  The complexity of XPath query evaluation and XML typing , 2005, JACM.

[22]  Wenfei Fan,et al.  Reasoning about Keys for XML , 2001, DBPL.

[23]  Marcelo Arenas,et al.  Design principles for XML data , 2005 .

[24]  Dan Suciu,et al.  Processing XML Streams with Deterministic Automata , 2003, ICDT.

[25]  Wenfei Fan,et al.  Reasoning about keys for XML , 2003, Inf. Syst..

[26]  Alin Deutsch,et al.  XPath Rewriting Using Multiple Views: Achieving Completeness and Efficiency , 2008, WebDB.

[27]  Serge Abiteboul,et al.  Representing and querying XML with incomplete information , 2001, PODS '01.

[28]  Dawn Xiaodong Song,et al.  Homomorphic Signature Schemes , 2002, CT-RSA.

[29]  Dan Suciu,et al.  Containment and equivalence for an XPath fragment , 2002, PODS.

[30]  Alon Y. Halevy,et al.  Updating XML , 2001, SIGMOD '01.

[31]  Markus Lupp,et al.  Extensible Markup Language , 2008, Encyclopedia of GIS.

[32]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[33]  Alin Deutsch,et al.  XML queries and constraints, containment and reformulation , 2005, Theor. Comput. Sci..

[34]  Abel,et al.  A formal semantics of patterns in XSLT , 2000 .

[35]  Amos Fiat,et al.  Digital signatures for modifiable collections , 2006, First International Conference on Availability, Reliability and Security (ARES'06).