Identifying XML Schema Constraints Using Temporal Logic

Twig pattern minimization is an important aspect of XML query optimization. During the minimizing process, it usually needs to take advantage of the constraints of XML Schema. The traditional methods for identifying constraints is to develop corresponding algorithms based on the type of constraints. It is inflexible because the constraints may be changed as new Twig pattern optimizing rules are found. Since the constraints of XML Schema mainly depict the sequence relationship of nodes, it is natural to be described by temporal logic. Based on the recognition, this paper proposes a method of identifying XML Schema constraints using temporal logic. Concretely, an XML Schema is modeled as a graph. In order to easily represent constraints related to parent and ancestor nodes, we made some modifications to Computational Tree Logic(CTL) with backward temporal operators, and developed model checking algorithms for automatically identifying XML Schema constraints. Compared with traditional methods, our method is more flexibility.

[1]  David Lacey,et al.  Program transformations using temporal logic side conditions , 2009, TOPL.

[2]  Laura Bozzelli.  The Complexity of CTL* + Linear Past , 2008, FoSSaCS.

[3]  Ki-Hoon Lee,et al.  XMin: Minimizing Tree Pattern Queries with Minimality Guarantee , 2010, World Wide Web.

[4]  M. de Rijke,et al.  CTL model checking for processing simple XPath queries , 2004, Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004..

[5]  Laks V. S. Lakshmanan,et al.  Tree pattern query minimization , 2002, The VLDB Journal.

[6]  Wolfgang Thomas,et al.  Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree , 1987, ICALP.

[7]  Orna Kupferman,et al.  Memoryful Branching-Time Logic , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[8]  Philippe Schnoebelen,et al.  Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[9]  Curtis E. Dyreson,et al.  Adding Temporal Constraints to XML Schema , 2012, IEEE Transactions on Knowledge and Data Engineering.

[10]  Dunren Che,et al.  An efficient algorithm for tree pattern query minimization under broad integrity constraints , 2007, Int. J. Web Inf. Syst..

[11]  Amir Pnueli,et al.  Once and for all , 1995, J. Comput. Syst. Sci..

[12]  Husheng Liao,et al.  Optimize Twig Query Pattern Based on XML Schema , 2013, J. Softw..

[13]  Bernhard Steffen,et al.  Data Flow Analysis as Model Checking , 1990, TACS.

[14]  Leonid Libkin.  Logics for Unranked Trees: An Overview , 2005, ICALP.

[15]  Marco Pistore,et al.  The planning spectrum - one, two, three, infinity , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[16]  Cristina Sirangelo,et al.  Reasoning about XML with Temporal Logics and Automata , 2008, LPAR.

[17]  Marcelo Arenas,et al.  Combining Temporal Logics for Querying XML Documents , 2007, ICDT.

[18]  Laks V. S. Lakshmanan,et al.  TAX: A Tree Algebra for XML , 2001, DBPL.

[19]  Chee Yong Chan,et al.  Minimization of tree pattern queries with constraints , 2008, SIGMOD Conference.

[20]  Ji-Ye Liang,et al.  Minimization of Path Expression Under Structural Integrity Constraints for XML: Minimization of Path Expression Under Structural Integrity Constraints for XML , 2009 .