ACM SIGMOD Record
On the Complexity of Verifying Consistency of XML Specifications
SIAM Journal on Computing
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)
ICDT'07 Proceedings of the 11th international conference on Database Theory
A precious class of cardinality constraints for flexible XML data processing
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
| Hi-index | 0.00 |
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys have an impact on several XML applications. A challenge is to identify expressive classes of keys with good computational properties. In this paper, we propose such a new class of keys. In comparison to previous work, the new class of XML keys is defined using a more expressive navigational path language that allows the specification of single-label wildcards. This provides designers with an enhanced ability to capture properties of XML data that are significant for the application at hand.We establish a sound and complete set of inference rules that characterizes all keys that are implicit in the explicit specification of XML keys. Furthermore, we establish an efficient algorithm for deciding XML key implication.