摘要: We extend FDs to be satisfied in an integrated XML document by comparing the values of leaf nodes a specified context its corresponding tree and show that Lien Atzeni's axiom system for trees is sound complete. Given T set F defined over targeted functional path expressions ?, we tackle problem finding most precise approximation T. formalize notion allowing data degenerating into sets strings. Each string such degenerated interpreted as being equally true document. Our main contribution develop novel efficient XChase procedure tool maintain consistency with respect F.