A precious class of cardinality constraints for flexible XML data processing

Authors:
Flavio Ferrarotti;Sven Hartmann;Sebastian Link
Affiliations:
Victoria University of Wellington, New Zealand;Clausthal University of Technology, Germany;Victoria University of Wellington, New Zealand
Venue:
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Year:
2011

Citing 11
Cited 2

Cardinality constraints in semantic data models

Data & Knowledge Engineering
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
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)
On the Complexity of Verifying Consistency of XML Specifications

SIAM Journal on Computing
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)
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

Armstrong databases: validation, communication and consolidation of conceptual models with perfect test data

APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
Efficiency frontiers of XML cardinality constraints

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern Web developers must often process collections of XML data that are aggregated from potentially thousands of heterogeneous sources. While the semi-structured nature of XML provides a high degree of syntactic flexibility there are significant shortcomings to specify the semantics of its data. For the advancement of XML applications it is therefore an important problem to identify natural classes of constraints that can be utilized effectively by XML data engineers. The problem is challenging given the range of intractability results in the area. In this paper we propose a class of XML cardinality constraints that is sufficiently flexible to process concisely XML data from various sources. The flexibility is a result of the right balance between expressiveness and efficiency of maintenance. In particular, we characterize the associated implication problem axiomatically, and algorithmically by a low-degree polynomial time decision procedure. Our class is precious as small extensions in expressiveness result in intractability.