Inferences for numerical dependencies
Theoretical Computer Science
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Cardinality constraints in semantic data models
Data & Knowledge Engineering
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
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)
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
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
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
A Web odyssey: from codd to XML
ACM SIGMOD Record
Reasoning about participation constraints and Chen's constraints
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
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)
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)
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
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)
Soft constraints and heuristic constraint correction in entity-relationship modelling
Proceedings of the 2nd international conference on Semantics in databases
Consistent query answering: five easy pieces
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
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics
Information Processing Letters
On the role of the complementation rule for data dependencies over incomplete relations
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
The boyce-codd-heath normal form for SQL
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
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
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
Foundations for a fourth normal form over SQL-Like databases
Conceptual Modelling and Its Theoretical Foundations
ACM Transactions on Database Systems (TODS)
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Hi-index | 0.00 |
Boundaries occur naturally in everyday life. This paper introduces numerical constraints into the framework of XML to take advantage of the benefits that result from the explicit specification of such boundaries. Roughly speaking, numerical constraints restrict the number of elements in an XML data fragment based on the data values of selected subelements. Efficient reasoning about numerical constraints provides effective means for predicting the number of answers to XQuery and XPath queries, the number of updates when using the XQuery update facility, and the number of encryptions or decryptions when using XML encryption. Moreover, numerical constraints can help to optimise XQuery and XPath queries, to exclude certain choices of indices from the index selection problem, and to generate views for efficient processing of common queries and updates. We investigate decision problems associated with numerical constraints in order to capitalise on the range of applications in XML data processing. To begin with we demonstrate that the implication problem is strongly coNP-hard for several classes of numerical constraints. These sources of potential intractability direct our attention towards the class of numerical keys that permit the specification of positive upper bounds. Numerical keys are of interest as they are reminiscent of cardinality constraints that are widely used in conceptual data modelling. At the same time, they form a natural generalisation of XML keys that are popular in XML theory and practice. We show that numerical keys are finitely satisfiable and establish a finite axiomatisation for their implication problem. Finally, we propose an algorithm that decides numerical key implication in quadratic time using shortest path methods.