Keys with Upward Wildcards for XML

The paper proposes a key constraint language for XML and investigates its associated decision problems. The language is defined in terms of regular path expressions extended with downward and upward wildcards, which can not only move down XML document trees, but also upwards. In a uniform syntax it is capable of expressing both absolute keys and relative keys, which are important to hierarchically structured data. In addition, keys defined in the language can be reasoned about efficiently. The paper provides a sound and complete set of inference rules and a cubic time algorithm for determining implication of the keys.

[1]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[2]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[3]  T. G. Szymanski,et al.  On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[4]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

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

[6]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[7]  Paul Strauss,et al.  Motorola Inc. , 1993 .

[8]  Grant E. Weddell,et al.  Reasoning About Equations and Functional Dependencies on Complex Objects , 1994, IEEE Trans. Knowl. Data Eng..

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

[10]  Minoru Ito,et al.  Implication Problems for Functional Constraints on Databases Supporting Complex Objects , 1994, J. Comput. Syst. Sci..

[11]  Patrick Valduriez,et al.  A Methodology for Query Reformulation in CIS Using Semantic Knowledge , 1996, Int. J. Cooperative Inf. Syst..

[12]  Zahir Tari,et al.  Object normal forms and dependency constraints for object-oriented schemata , 1997, TODS.

[13]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[14]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, PODS '97.

[15]  Wenfei Fan,et al.  Path constraints on semistructured and structured data , 1998, PODS '98.

[16]  David Schach,et al.  XML Query Language (XQL) , 1998, QL.

[17]  Wenfei Fan,et al.  Interaction between path and type constraints , 1999, PODS '99.

[18]  Chaitanya K. Baru,et al.  XML-based information mediation with MIX , 1999, SIGMOD '99.

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

[20]  Wenfei Fan,et al.  Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model , 1999, DBPL.

[21]  Carmem S. Hara,et al.  Reasoning about nested functional dependencies , 1999, PODS '99.

[22]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

[23]  Grace SauLan Loo,et al.  An Interface to Databases for Flexible Query Answering: A Fuzzy-Set Approach , 2000, DEXA.

[24]  Wenfei Fan,et al.  Path Constraints in Semistructured Databases , 2000, J. Comput. Syst. Sci..

[25]  Wenfei Fan,et al.  Integrity constraints for XML , 2000, PODS '00.

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

[27]  Andreas Rauber,et al.  Providing Topically Sorted Access to Subsequently Releases Newspaper Editions or: How to Build Your Private Digital Library , 2000, DEXA.

[28]  Takahiro Hara,et al.  Database Migration in WAN Environments: How Can It Earn Good Performance? , 2000, DEXA.

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

[30]  Wenfei Fan,et al.  Keys for XML , 2001, WWW '01.

[31]  Wenfei Fan,et al.  On XML integrity constraints in the presence of DTDs , 2001, PODS '01.

[32]  Wenfei Fan,et al.  Constraints for semistructured data and XML , 2001, SGMD.

[33]  Interaction between path and type constraints , 2003, TOCL.

[34]  P. Malik.  On equivalence. , 2003, The Canadian journal of cardiology.