research-article

Free access

Expressive, yet tractable XML keys

Authors:

Sebastian LinkAuthors Info & Claims

EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Pages 357 - 367

https://doi.org/10.1145/1516360.1516402

Published: 24 March 2009 Publication History

Abstract

Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In particular, suitable notions of keys will enhance XML's capabilities of modeling, managing and processing native XML data. However, the different ways of accessing and comparing XML elements make it challenging to balance expressiveness and tractability.

We investigate XML keys which uniquely identify XML elements based on a very general notion of value-equality: isomorphic subtrees with the identity on data values. Previously, an XML key fragment has been recognised that is robust in the sense that its implication problem can be expressed as the reachability problem in a suitable digraph. We analyse the impact of extending this fragment by structural keys that uniquely identify XML elements independently of any data. We establish a sound and complete set of inference rules for this expressive fragment of XML keys, and encode these rules in an algorithm that decides the associated implication problem in time quadratic in the size of the input keys. Consequently, we gain significant expressiveness without any loss of efficiency in comparison to less expressive XML key fragments.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

V. Apparao et al. Document object model (DOM) Level 1 Specification, W3C Recommendation, Oct. 1998. http://www.w3.org/TR/REC-DOM-Level-1/.

[3]

M. Arenas, W. Fan, and L. Libkin. What's hard about XML schema constraints? In Proceedings of the 13th International Conference Database and Expert Systems Applications - DEXA 2002, number 2453 in Lecture Notes in Computer Science, pages 269--278. Springer, 2002.

Digital Library

[4]

M. Arenas and L. Libkin. A normal form for XML documents. Trans. Database Syst., 29(1):195--232, 2004.

Digital Library

[5]

M. Arenas and L. Libkin. An information-theoretic approach to normal forms for relational and XML data. J. ACM, 52(2):246--283, 2005.

Digital Library

[6]

M. Benedikt, W. Fan, and G. Kuper. Structural properties of XPath fragments. Theor. Comput. Sci., 336(1):3--31, 2005.

Digital Library

[7]

T. Bray, J. Paoli, C. M. Sperberg-McQueen, E. Maler, and F. Yergeau. Extensible markup language (XML) 1.0 (Fourth Edition) W3C Recommendation, Aug. 2006. http://www.w3.org/TR/xml/.

[8]

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

[9]

P. Buneman, S. Davidson, W. Fan, C. Hara, and W. Tan. Reasoning about keys for XML. Inf. Syst., 28(8):1037--1063, 2003.

Digital Library

[10]

P. Buneman, W. Fan, J. Siméon, and S. Weinstein. Constraints for semi-structured data and XML. SIGMOD Record, 30(1):47--54, 2001.

Digital Library

[11]

P. Buneman, W. Fan, and S. Weinstein. Path constraints in semistructured databases. J. Comput. Syst. Sci., 61(2):146--193, 2000.

Digital Library

[12]

S. Davidson, W. Fan, and C. Hara. Propagating XML constraints to relations. J. Comput. Syst. Sci., 73(3):316--361, 2007.

Digital Library

[13]

S. Davidson, W. Fan, and C. Hara. Erratum to "Propagating XML constraints to relations". J. Comput. Syst. Sci., 74(3):404--405, 2008.

Digital Library

[14]

A. Deutsch and V. Tannen. XML queries and constraints, containment and reformulation. Theor. Comput. Sci., 336(1):57--87, 2005.

Digital Library

[15]

W. Fan. XML constraints. In DEXA Workshops, pages 805--809, 2005.

[16]

W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM, 49(3):368--406, 2002.

Digital Library

[17]

W. Fan and J. Siméon. Integrity constraints for XML. J. Comput. Syst. Sci., 66(1):254--291, 2003.

Digital Library

[18]

S. Hartmann, H. Köhler, S. Link, T. Trinh, and J. Wang. On the notion of an XML key. In Proceedings of the 3rd International Workshop on Semantics in Data and Knowledge Bases - SDKB 2008, number 4925 in Lecture Notes in Computer Science, pages 114--123. Springer, 2007.

[19]

S. Hartmann and S. Link Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic, 152(1--3):84--106, 2008.

[20]

S. Hartmann and S. Link. Numerical constraints for XML. In Proceedings of the 14th International Workshop on Logic, Language, Information and Computation - WoLLIC 2007, number 4576 in Lecture Notes in Computer Science, pages 203--217. Springer, 2007.

Digital Library

[21]

S. Hartmann and S. Link. Unlocking keys for XML trees. In Proceedings of the 11th International Conference on Database Theory - ICDT 2007, number 4353 in Lecture Notes in Computer Science, pages 104--118. Springer, 2007.

Digital Library

[22]

S. Hartmann and T. Trinh. Axiomatising functional dependencies for XML with frequencies. In Proceedings of the 4th International Symposium on Foundations of Information and Knowledge Systems - FolKS 2006, number 3861 in Lecture Notes in Computer Science, pages 159--178. Springer, 2006.

Digital Library

[23]

D. Jungnickel. Graphs, Networks and Algorithms. Springer, 1999.

[24]

J. Clark and S. DeRose. XML Path Language (XPath) Version 1.0 W3C Recommendation Nov. 1999. http://www.w3.org/TR/xpath.

[25]

S. Link. On the Implication of Multivalued Dependencies in Partial Database Relations. Int. J. Found. Comput. Sci., 19(3):691--715, 2008.

[26]

S. Link. Charting the completeness frontier of inference systems for multivalued dependencies. Acta Inf., 45(7--8):565--591, 2008.

Digital Library

[27]

G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1):2--45, 2004.

Digital Library

[28]

F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3), 2006.

[29]

S. e. a. Pemberton. XHTML 1.0 The Extensible HyperText Markup Language (Second Edition) W3C Recommendation, Jan. 2000. http://www.w3.org/TR/xhtml1.

[30]

L. V. Saxton and X. Tang. Tree Multivalued Dependencies for XML Datasets. In Proceedings of the 5th International Conference on Advances in Web-Age Information Management - WAIM 2004, number 3129 in Lecture Notes in Computer Science, pages 357--367. Springer, 2004.

[31]

D. Suciu. On database theory and XML. SIGMOD Record, 30(3):39--45, 2001.

Digital Library

[32]

H. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. XML Schema Part 1: Structures second edition, W3C Recommendation, Oct. 2004. http://www.w3.org/TR/xmlschema-1/.

[33]

V. Vianu. A web odyssey: from Codd to XML. SIGMOD Record, 32(2):68--77, 2003.

Digital Library

[34]

M. W. Vincent, J. Liu and C. Liu. A Redundancy Free 4NF for XML. In Proceedings of the First International XML Database Symposium - XSym 2003, number 2824 in Lecture Notes in Computer Science, pages 254--266. Springer, 2003.

[35]

M. W. Vincent, J. Liu and C. Liu. Strong functional dependencies and their application to normal forms in XML. Trans. Database Syst., 29(3):445--462, 2004.

Digital Library

[36]

M. W. Vincent, J. Liu and M. K. Mohania. On the equivalence between FDs in XML and FDs in relations. Acta Inf., 44(3--4): 207--247, 2007.

Digital Library

[37]

J. Wang. Using tree patterns for flexible handling of XML trees. Master's thesis, Massey University, 2007.

[38]

P. Wood. Containment for XPath fragments under DTD constraints. In Proceedings of the 9th International Conference on Database Theory - ICDT 2003, pages 300--314, 2003.

Digital Library

Cited By

Link S(2023)Entity integrity management under data volume, variety and veracityKnowledge and Information Systems10.1007/s10115-022-01814-165:7(2895-2934)Online publication date: 25-Jan-2023
https://doi.org/10.1007/s10115-022-01814-1
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
Brown PLink S(2017)Probabilistic KeysIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.263334229:3(670-682)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1109/TKDE.2016.2633342
Show More Cited By

Expressive, yet tractable XML keys
1. Applied computing
  1. Document management and text processing

Recommendations

Transition of Keys in XML Data Transformation
CSA '08: Proceedings of the International Symposium on Computer Science and its Applications

Transformation of a source schema to a target schema is an important activity in data integration. In XML data transformation for data integration purposes, when an XML source schema with its conforming data is transformed to the target XML schema, one ...
XML: Visual QuickStart Guide
Tractable XML data exchange via relations
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management

We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document and answer target queries in a way that is consistent with source ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

March 2009

1180 pages

ISBN:9781605584225

DOI:10.1145/1516360

Editors:
Martin Kersten
CWI, The Netherlands
,
Boris Novikov
University of Saint Petersburg, Russia
,
Jens Teubner
ETH Zurich, Switzerland
,
Vladimir Polutin
HP Labs, Russia
,
Stefan Manegold
CWI, The Netherlands

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

EDBT/ICDT '09

EDBT/ICDT '09: EDBT/ICDT '09 joint conference

March 24 - 26, 2009

Saint Petersburg, Russia

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
205
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)5

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Link S(2023)Entity integrity management under data volume, variety and veracityKnowledge and Information Systems10.1007/s10115-022-01814-165:7(2895-2934)Online publication date: 25-Jan-2023
https://doi.org/10.1007/s10115-022-01814-1
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
Brown PLink S(2017)Probabilistic KeysIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.263334229:3(670-682)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1109/TKDE.2016.2633342
Roblot TLink S(2016)Possibilistic Cardinality Constraints and Functional DependenciesConceptual Modeling10.1007/978-3-319-46397-1_11(133-148)Online publication date: 7-Oct-2016
https://doi.org/10.1007/978-3-319-46397-1_11
Köhler HLink SBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Inclusion Dependencies ReloadedProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806539(1361-1370)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806539
Ferrarotti FHartmann SLink SMarin MMuñoz E(2013)The Finite Implication Problem for Expressive XML Keys: Foundations, Applications, and Performance EvaluationTransactions on Large-Scale Data- and Knowledge-Centered Systems X10.1007/978-3-642-41221-9_3(60-94)Online publication date: 2013
https://doi.org/10.1007/978-3-642-41221-9_3
Ferrarotti FHartmann SLink S(2011)A precious class of cardinality constraints for flexible XML data processingProceedings of the 30th international conference on Conceptual modeling10.5555/2075144.2075163(175-188)Online publication date: 31-Oct-2011
https://dl.acm.org/doi/10.5555/2075144.2075163
Tan ZZhang L(2011)Repairing XML functional dependency violationsInformation Sciences: an International Journal10.1016/j.ins.2011.07.022181:23(5304-5320)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1016/j.ins.2011.07.022
Ferrarotti FHartmann SLink S(2011)A Precious Class of Cardinality Constraints for Flexible XML Data ProcessingConceptual Modeling – ER 201110.1007/978-3-642-24606-7_14(175-188)Online publication date: 2011
https://doi.org/10.1007/978-3-642-24606-7_14
Ferrarotti FHartmann SLink SWang J(2010)Promoting the semantic capability of XML keysProceedings of the 7th international XML database conference on Database and XML technologies10.5555/1888011.1888027(144-153)Online publication date: 17-Sep-2010
https://dl.acm.org/doi/10.5555/1888011.1888027
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents