Series Efficiency Frontiers of XML Cardinality Constraints

XML has gained widespread acceptance as a premier format for publishing, sharing and manipulating data through the web. While the semi-structured nature of XML provides a high degree of syntactic flexibility there are significant shortcomings when it comes to specifying the semantics of XML data. For the advancement of XML applications it is therefore a major challenge to discover natural classes of constraints that can be utilized effectively by XML data engineers. This endeavor is ambitious given the multitude of intractability results that have been established. We investigate a class of XML cardinality constraints that is precious in the sense that it keeps the right balance between expressiveness and efficiency of maintenance. In particular, we characterize the associated implication problem axiomatically and develop a low-degree polynomial time algorithm that can be readily applied for deciding implication. Our class of constraints is chosen near-optimal as already minor extensions of its expressiveness cause potential intractability. Finally, we transfer our findings to establish a precious class

[1]  Bernhard Thalheim,et al.  Fundamentals of Cardinality Constraints , 1992, ER.

[2]  Diego Calvanese,et al.  On the interaction between ISA and cardinality constraints , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[3]  Steven J. DeRose,et al.  XML Path Language (XPath) Version 1.0 , 1999 .

[4]  Sven Hartmann,et al.  Numerical constraints on XML data , 2010, Inf. Comput..

[5]  Bernhard Thalheim,et al.  Foundations of entity-relationship modeling , 1993, Annals of Mathematics and Artificial Intelligence.

[6]  Sven Hartmann,et al.  Constraint acquisition for Entity-Relationship models , 2009, Data Knowl. Eng..

[7]  Sherif Sakr,et al.  Dependable cardinality forecasts for XQuery , 2008, Proc. VLDB Endow..

[8]  Sherif Sakr,et al.  XSelMark: A Micro-benchmark for Selectivity Estimation Approaches of XML Queries , 2008, DEXA.

[9]  Diego Calvanese,et al.  OCL-Lite: Finite reasoning on UML/OCL conceptual schemas , 2012, Data Knowl. Eng..

[10]  Sven Hartmann,et al.  On the implication problem for cardinality constraints and functional dependencies , 2001, Annals of Mathematics and Artificial Intelligence.

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

[12]  Michael Schrefl,et al.  Keys in XML: Capturing Identification and Uniqueness , 2009, WISE.

[13]  Stefan Böttcher,et al.  XPath Selectivity Estimation for a Mobile Auction Application , 2007, 11th International Database Engineering and Applications Symposium (IDEAS 2007).

[14]  Bernhard Thalheim.  Integrity Constraints in (Conceptual) Database Models , 2008, The Evolution of Conceptual Modeling.

[15]  Peter P. Chen.  The Entity-Relationship Model: Towards a unified view of Data , 1976 .

[16]  Sebastian Link,et al.  Know your Limits: Enhanced XML Modeling with Cardinality Constraints , 2007, ER.

[17]  Wenfei Fan,et al.  What's Hard about XML Schema Constraints? , 2002, DEXA.

[18]  Sebastian Link,et al.  Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies , 2010, Inf. Syst..

[19]  Sebastian Link.  Characterisations of multivalued dependency implication over undetermined universes , 2012, J. Comput. Syst. Sci..

[20]  Sven Hartmann,et al.  Expressive, yet tractable XML keys , 2009, EDBT '09.

[21]  Sven Hartmann,et al.  Efficient reasoning about a robust XML key fragment , 2009, TODS.

[22]  Wen-Chi Hou,et al.  A sampling approach for XML query selectivity estimation , 2009, EDBT '09.

[23]  Sven Hartmann,et al.  Numerical Constraints for XML , 2007, WoLLIC.

[24]  M. Tamer Özsu,et al.  XSEED: Accurate and Fast Cardinality Estimation for XPath Queries , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[25]  Martin Necaský.  XSEM - A Conceptual Model for XML , 2007, APCCM.

[26]  Jakub Malý,et al.  When conceptual model meets grammar: A dual approach to XML data modeling , 2012, Data Knowl. Eng..

[27]  Mukesh K. Mohania,et al.  The implication problem for 'closest node' functional dependencies in complete XML documents , 2012, J. Comput. Syst. Sci..

[28]  Sven Hartmann,et al.  The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations , 2012, TODS.

[29]  Chen Zhan-sheng,et al.  Strong functional dependencies and their application to normal forms in XML , 2005 .

[30]  Michael Schrefl,et al.  Inclusion Dependencies in XML: Extending Relational Semantics , 2009, DEXA.

[31]  Wenfei Fan,et al.  On the Complexity of Verifying Consistency of XML Specifications , 2008, SIAM J. Comput..

[32]  Andrew J. McAllister.  Complete Rules for n-Ary Relationship Cardinality Constraints , 1998, Data Knowl. Eng..

[33]  Sven Hartmann,et al.  Solving the Implication Problem for XML Functional Dependencies with Properties , 2010, WoLLIC.

[34]  David W. Embley,et al.  Cardinality Constraints in Semantic Data Models , 1993, Data Knowl. Eng..

[35]  David Beech,et al.  XML-Schema Part 1: Structures Second Edition , 2004 .

[36]  Diego Calvanese,et al.  Reasoning over Extended ER Models , 2007, ER.

[37]  Sven Hartmann,et al.  Design by example for SQL table definitions with functional dependencies , 2012, The VLDB Journal.

[38]  Sven Hartmann,et al.  Unlocking Keys for XML Trees , 2007, ICDT.

[39]  Juliana Freire,et al.  StatiX: making XML count , 2002, SIGMOD '02.

[40]  Marcelo Arenas,et al.  An information-theoretic approach to normal forms for relational and XML data , 2003, PODS.

[41]  Bernhard Thalheim,et al.  Armstrong Databases and Reasoning for Functional Dependencies and Cardinality Constraints over Partial Bags , 2012, FoIKS.

[42]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

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

[44]  Maurizio Lenzerini,et al.  On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata , 1987, VLDB.

[45]  Sven Hartmann,et al.  Performance Analysis of Algorithms to Reason about XML Keys , 2012, DEXA.

[46]  Carlo Sartiani.  A General Framework for Estimating XML Query Cardinality , 2003, DBPL.

[47]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[48]  Jing Wang,et al.  Promoting the Semantic Capability of XML Keys , 2010, XSym.

[49]  Faiz Currim,et al.  The CARD System , 2010, ER.

[50]  Renée J. Miller,et al.  Towards Inconsistency Management in Data Integration Systems , 2003, IIWeb.

[51]  Mong-Li Lee,et al.  An Estimation System for XPath Expressions , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[52]  Sven Hartmann,et al.  A Precious Class of Cardinality Constraints for Flexible XML Data Processing , 2011, ER.