Inferences for numerical dependencies
Theoretical Computer Science
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-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 the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
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)
The optimal selection of secondary indices is NP-complete
ACM SIGMOD Record
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
Efficient reasoning about XFDs with pre-image semantics
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
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
Know your limits: enhanced XML modeling with cardinality constraints
ER '07 Tutorials, posters, panels and industrial contributions at the 26th international conference on Conceptual modeling - Volume 83
Semantics in Data and Knowledge Bases
Expressive, yet tractable XML keys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
Spoilt for Choice: Full First-Order Hierarchical Decompositions
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On Matrix Representations of Participation Constraints
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
Efficient derivation of numerical dependencies
Information Systems
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
| Hi-index | 0.00 |
We introduce numerical constraints into the context of XML which restrict the number of nodes within subtrees of an XML tree that contain specific value-equal subnodes. We demonstrate the applicability of numerical constraints by optimising XML queries and predicting the number of XML query answers, updates and encryptions. In order to effectively unlock the wide range of XML applications decision problems associated with numerical constraints are investigated. The implication problem is coNP-hard for several restricted classes of numerical constraints. These sources of intractability direct our attention towards numerical keys that permit the specification of upper bounds. Keys, as introduced by Buneman et al., are numerical keys with upper bound 1. Numerical keys are finitely satisfiable, finitely axiomatisable, and their implication problem is decidable in quadratic time.