On the Existence of Armstrong Data Trees for XML Functional Dependencies

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set Σ from a fixed constraint class \(\mathcal Z\) satisfies precisely those constraints from \(\mathcal Z\) that are logically implied by Σ. In this paper we study Armstrong data trees for functional dependencies for XML-encoded data in the context of a simple XML tree model reflecting the permitted parent-child relationships together with their frequencies.