On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Cardinality constraints in semantic data models
Data & Knowledge Engineering
Complete rules for n-ary relationship cardinality constraints
Data & Knowledge Engineering
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
Fundamentals of Cardinality Constraints
ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
What's Hard about XML Schema Constraints?
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
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)
An Estimation System for XPath Expressions
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
XSEM: a conceptual model for XML
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
XPath Selectivity Estimation for a Mobile Auction Application
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
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
On the Complexity of Verifying Consistency of XML Specifications
SIAM Journal on Computing
XSelMark: A Micro-benchmark for Selectivity Estimation Approaches of XML Queries
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Dependable cardinality forecasts for XQuery
Proceedings of the VLDB Endowment
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)
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Inclusion Dependencies in XML: Extending Relational Semantics
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Keys in XML: Capturing Identification and Uniqueness
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Numerical constraints on XML data
Information and Computation
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Reasoning over extended ER models
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Solving the implication problem for XML functional dependencies with properties
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, 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
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Integrity constraints in (conceptual) database models
The evolution of conceptual modeling
A precious class of cardinality constraints for flexible XML data processing
ER'11 Proceedings of the 30th international conference on Conceptual modeling
ICDT'07 Proceedings of the 11th international conference on Database Theory
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
OCL-Lite: Finite reasoning on UML/OCL conceptual schemas
Data & Knowledge Engineering
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
The implication problem for 'closest node' functional dependencies in complete XML documents
Journal of Computer and System Sciences
ACM Transactions on Database Systems (TODS)
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Hi-index | 0.00 |
XML has gained widespread acceptance as a premier format for publishing, sharing and manipulating data through the web. While the semi-structured nature of XML provides a high degree of syntactic flexibility there are significant shortcomings when it comes to specifying the semantics of XML data. For the advancement of XML applications it is therefore a major challenge to discover natural classes of constraints that can be utilized effectively by XML data engineers. This endeavor is ambitious given the multitude of intractability results that have been established. We investigate a class of XML cardinality constraints that is precious in the sense that it keeps the right balance between expressiveness and efficiency of maintenance. In particular, we characterize the associated implication problem axiomatically and develop a low-degree polynomial time algorithm that can be readily applied for deciding implication. Our class of constraints is chosen near-optimal as already minor extensions of its expressiveness cause potential intractability. Finally, we transfer our findings to establish a precious class of soft cardinality constraints on XML data. Soft cardinality constraints need to be satisfied on average only, and thus permit violations in a controlled manner. Soft constraints are therefore able to tolerate exceptions that frequently occur in practice, yet can be reasoned about efficiently.