article

Reasoning about keys for XML

Authors:

Susan Davidson,

Wang-Chiew TanAuthors Info & Claims

Information Systems, Volume 28, Issue 8

Pages 1037 - 1063

https://doi.org/10.1016/S0306-4379(03)00028-0

Published: 01 December 2003 Publication History

Abstract

We study absolute and relative keys for XML, and investigate their associated decision problems. We argue that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, we show that these keys are always (finitely) satisfiable, and their (finite) implication problem is finitely axiomatizable. Furthermore, we provide a polynomial time algorithm for determining (finite) implication in the size of keys. Our results also demonstrate, among other things, that the analysis of XML keys is far more intricate than its relational counterpart.

References

[1]

{1} T. Bray, J. Paoli, C.M. Sperberg-McQueen, Extensible Markup Language (XML) 1.0, World Wide Web Consortium (W3C), 1998, http://www.w3.org/TR/REC-xml.]]

[2]

{2} A. Layman, et al., XML-Data, W3C Note, 1998, http:// www.w3.org/TR/1998/NOTE-XML-data.]]

[3]

{3} H.S. Thompson, D. Beech, M. Maloney, N. Mendelsohn, XML Schema Part 1: Structures, W3C Working Draft, 2001, http://www.w3.org/TR/xmlschema-1/.]]

[4]

{4} P. Buneman, S. Davidson, W. Fan, C. Hara, W. Tan, Keys for XML, Computer Networks 39 (5) (2002) 473-487.]]

[5]

{5} P. Buneman, S. Davidson, W. Fan, C. Hara, W. Tan, Reasoning about keys for XML, in: G. Ghelli and G. Grahne (Eds.), Lecture Notes in Computer Science (DBPL'2001), Vol. 2397, 2001, pp. 133-148.]]

[6]

{6} H. Thompson, personal communication.]]

[7]

{7} V. Apparao, et al., Document Object Model (DOM) Level 1 Specification, W3C Recommendation, 1998, http://www.w3.org/TR/REC-DOM-Level-1/.]]

[8]

{8} J. Clark, XSL Transformations (XSLT), W3C Recommendation, 1999, http://www.w3.org/TR/xslt.]]

[9]

{9} P. Wadler, A formal semantics for patterns in XSL, Technical Report, Computing Sciences Research Center, Bell Labs, Lucent Technologies, 2000.]]

[10]

{10} J. Robie, J. Lapp, D. Schach, XML Query Language (XQL), Workshop on XML Query Languages, Boston, MA, 1998.]]

[11]

{11} D. Benson, et al., GenBank, Nucleic Acids Res. 28 (2000) 15-18.]]

[12]

{12} J. Sulston, et al., The C. elegans genome sequencing project: a beginning, Nature 356 (6364) (1992) 37-41.]]

[13]

{13} W. Baker, et al., The EMBL nucleotide sequence database, Nucleic Acids Res. 28 (2000) 19-23.]]

[14]

{14} A. Bairoch, R. Apweiler, The SWISS-PROT protein sequence database and its supplement TrEMBL, Nucleic Acids Res. 28 (2000) 45-48.]]

[15]

{15} M. Arenas, W. Fan, L. Libkin, On verifying consistency of XML specifications, in: Proceedings of ACM Symposium on Principles of Database Systems (PODS), Madison, WI, 2002.]]

[16]

{16} W. Fan, L. Libkin, On XML integrity constraints in the presence of DTDs, J. Assoc. Comput. Mach. 49 (3) (2002) 368-406.]]

Digital Library

[17]

{17} S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.]]

[18]

{18} R. Ramakrishnan, J. Gehrke, Database Management Systems, McGraw-Hill, New York, 2000.]]

[19]

{19} J. Clark, S. DeRose, XML Path Language (XPath), W3C Working Draft, 1999, http://www.w3.org/TR/xpath.]]

[20]

{20} G. Miklau, D. Suciu, Containment and equivalence for an XPath fragment, in: Proceedings of ACM Symposium on Principles of Database Systems (PODS), Madison, WI, 2002, pp. 65-76.]]

[21]

{21} F. Neven, T. Schwentick, XPath containment in the presence of disjunction, dtds, and variables, in: Proceedings of the International Conference on Database Theory, Siena, Italy, 2003.]]

[22]

{22} M. Benedikt, W. Fan, G. Kuper, Structural properties of XPath fragments, in: Proceedings of the International Conference on Database Theory, Siena, Italy, 2003.]]

Digital Library

[23]

{23} M. Arenas, W. Fan, L. Libkin, What's hard about XML Schema constraints?, in: Proceedings of 13th International Conference on Database and Expert Systems Applications (DEXA), Aix en Provence, 2002, pp. 269-278.]]

[24]

{24} W. Fan, J. Siméon, Integrity constraints for XML, in: Proceedings of ACM Symposium on Principles of Data-base Systems (PODS), Dallas, TX, 2000, pp. 23-34.]]

Digital Library

[25]

{25} S. Abiteboul, P. Buneman, D. Suciu, Data on the Web. From Relations to Semistructured Data and XML, Morgan Kaufmann, Los Altos, CA, 2000.]]

Digital Library

[26]

{26} S. Abiteboul, V. Vianu, Regular path queries with constraints, in: Proceedings of ACM Symposium on Principles of Database Systems (PODS), Tucson, AZ, 1997, pp. 122-133.]]

[27]

{27} P. Buneman, W. Fan, S. Weinstein, Interaction between path and type constraints, in: Proceedings of ACM Symposium on Principles of Database Systems (PODS), Philadelphia, PA, 1999, pp. 56-67.]]

[28]

{28} P. Buneman, W. Fan, S. Weinstein, Path constraints in semistructured databases, J. Comput. System Sci. 61 (2000) 146-193.]]

Digital Library

[29]

{29} M. Ito, G.E. Weddell, Implication problems for functional constraints on databases supporting complex objects, J. Comput. System Sci. 50 (1) (1995) 165-187.]]

Digital Library

[30]

{30} M.F. van Bommel, G.E. Weddell, Reasoning about equations and functional dependencies on complex objects, IEEE Trans. Data Knowledge Eng. 6 (3) (1994) 455-469.]]

Digital Library

[31]

{31} Z.M. Ozsoyoglu, L.-Y. Yuan, A new normal form for nested relations, ACM Trans. Database Systems 12 (1) (1987) 111-136.]]

Digital Library

[32]

{32} C.S. Hara, S.B. Davidson, Reasoning about nested functional dependencies, in: Proceedings of ACM Symposium on Principles of Database Systems (PODS), Philadelphia, Pennsylvania, 1999, pp. 91-100.]]

[33]

{33} P. Buneman, W. Fan, J. Siméon, S. Weinstein, Constraints for semistructured data and XML, SIGMOD Record 30 (1) (2001) 47-54.]]

Digital Library

[34]

{34} V. Vianu, A Web odyssey: from Codd to XML, in: Proceedings of ACM Symposium on Principles of Data-base Systems (PODS), Santa Barbara, CA, 2001, pp. 1-15.]]

[35]

{35} H. Hunt, D. Rosenkrantz, T. Szymanski, On the equivalence, containment, and covering problems for the regular and context-free languages, J. Comput. System Sci. 12 (1976) 222-268.]]

Digital Library

[36]

{36} J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.]]

[37]

{37} H.B. Enderton, A Mathematical Introduction to Logic, Academic Press, New York, 1972.]]

[38]

{38} M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.]]

Digital Library

[39]

{39} T. Milo, D. Suciu, Index structures for path expressions, in: Proceedings of the International Conference on Database Theory, Jerusalem, 1999, pp. 277-295.]]

[40]

{40} Microsoft XML Parser 4.0(MSXML), available at: http:// msdn.microsoft.com.]]

[41]

{41} XML Schema Validator, available at: http://www.ltg.ed.ac.uk/ht/xsv-status.html.]]

[42]

{42} Y. Chen, S. Davidson, Y. Zheng, Validating constraints in XML, Technical Report, Computer and Information Science Department, University of Pennsylvania, 2002.]]

[43]

{43} Y.Chen, S. Davidson, Y. Zheng, Constraint preserving xml storage in relations, in: Proceedings of the International Workshop on the Web and Databases (WebDB), Madison, WI, 2002.]]

[44]

{44} S. Davidson, W. Fan, C. Hara, J. Qin, Propagating XML constraints to relations, in: Proceedings of the International Conference on Data Engineering (ICDE), 2003.]]

Cited By

Angles RBonifati ADumbrava SFletcher GHare KHidders JLee VLi BLibkin LMartens WMurlak FPerryman JSavković OSchmidt MSequeda JStaworko STomaszuk DLi GLi ZIdreos SSrivastava D(2021)PG-Keys: Keys for Property GraphsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457561(2423-2436)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457561
Fan WLu P(2019)Dependencies for GraphsACM Transactions on Database Systems10.1145/328728544:2(1-40)Online publication date: 13-Feb-2019
https://dl.acm.org/doi/10.1145/3287285
Niewerth MSchwentick T(2018)Reasoning About XML Constraints Based on XML-to-Relational MappingsTheory of Computing Systems10.1007/s00224-018-9846-562:8(1826-1879)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00224-018-9846-5
Show More Cited By

Index Terms

Reasoning about keys for XML
1. Applied computing
  1. Document management and text processing
    1. Document preparation
      1. Markup languages
2. Information systems
  1. World Wide Web

Recommendations

Axiomatizations and computability of weighted monadic second-order logic
LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science

Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted formulas ...
Efficient reasoning about a robust XML key fragment

We review key constraints in the context of XML as introduced by Buneman et al. We demonstrate that:

(1) one of the proposed inference rules is not sound in general, and

(2) the inference rules are incomplete for XML key implication, even for nonempty ...
Efficient static analysis of XML paths and types
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation

We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time ...

Comments

Information & Contributors

Information

Published In

cover image Information Systems

Information Systems Volume 28, Issue 8

December 2003

177 pages

ISSN:0306-4379

Issue’s Table of Contents

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 December 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Angles RBonifati ADumbrava SFletcher GHare KHidders JLee VLi BLibkin LMartens WMurlak FPerryman JSavković OSchmidt MSequeda JStaworko STomaszuk DLi GLi ZIdreos SSrivastava D(2021)PG-Keys: Keys for Property GraphsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3457561(2423-2436)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3457561
Fan WLu P(2019)Dependencies for GraphsACM Transactions on Database Systems10.1145/328728544:2(1-40)Online publication date: 13-Feb-2019
https://dl.acm.org/doi/10.1145/3287285
Niewerth MSchwentick T(2018)Reasoning About XML Constraints Based on XML-to-Relational MappingsTheory of Computing Systems10.1007/s00224-018-9846-562:8(1826-1879)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00224-018-9846-5
Vidaković JRistić SKordić SLuković IZdravkova KEleftherakis GKefalas P(2017)Extended Tuple Constraint Type in Relational and XML Data ModelProceedings of the 8th Balkan Conference in Informatics10.1145/3136273.3136294(1-8)Online publication date: 20-Sep-2017
https://dl.acm.org/doi/10.1145/3136273.3136294
jia Lhusheng LDesai BToyama MBernardino J(2016)XML Type Dependency and XML Type Normal FormProceedings of the 20th International Database Engineering & Applications Symposium10.1145/2938503.2938536(272-277)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2938503.2938536
Vidaković JLuković IKordić SBădică CManolopoulos YCoşulschi MEleftherakis GLeon F(2015)Specification and Implementation of the Inverse Referential Integrity Constraint in XML DatabasesProceedings of the 7th Balkan Conference on Informatics Conference10.1145/2801081.2801111(1-8)Online publication date: 2-Sep-2015
https://dl.acm.org/doi/10.1145/2801081.2801111
Szabó GBenczúr A(2015)Functional dependencies on extended relations defined by regular languagesAnnals of Mathematics and Artificial Intelligence10.1007/s10472-013-9352-z73:1-2(205-243)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s10472-013-9352-z
Abedjan ZGolab LNaumann F(2015)Profiling relational dataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-015-0389-y24:4(557-581)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1007/s00778-015-0389-y
Arenas MDaenen JNeven FUgarte MBussche JVansummeren S(2014)Discovering XSD Keys from XML DataACM Transactions on Database Systems10.1145/263854739:4(1-49)Online publication date: 30-Dec-2014
https://dl.acm.org/doi/10.1145/2638547
Mlýnková INečaský M(2013)Heuristic Methods for Inference of XML SchemasInformatica10.5555/2699244.269924924:4(577-602)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.5555/2699244.2699249
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents