Path constraints in semistructured databases
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Constraints for semistructured data and XML
ACM SIGMOD Record
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
ACM SIGMOD Record
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
What's Hard about XML Schema Constraints?
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
A Web odyssey: from codd to XML
ACM SIGMOD Record
Journal of Computer and System Sciences - Special issue on PODS 2000
Information Systems
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
An information-theoretic approach to normal forms for relational and XML data
Journal of the ACM (JACM)
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
XML Queries and constraints, containment and reformulation
Theoretical Computer Science - Database theory
Propagating XML constraints to relations
Journal of Computer and System Sciences
On the equivalence between FDs in XML and FDs in relations
Acta Informatica
Journal of Computer and System Sciences
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
ICDT'07 Proceedings of the 11th international conference on Database Theory
Axiomatising functional dependencies for XML with frequencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Spoilt for Choice: Full First-Order Hierarchical Decompositions
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
On the Performances of Checking XML Key and Functional Dependency Satisfactions
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
Numerical constraints on XML data
Information and Computation
Promoting the semantic capability of XML keys
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
A precious class of cardinality constraints for flexible XML data processing
ER'11 Proceedings of the 30th international conference on Conceptual modeling
When conceptual model meets grammar: A dual approach to XML data modeling
Data & Knowledge Engineering
Repairing XML functional dependency violations
Information Sciences: an International Journal
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Hi-index | 0.00 |
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.