A Verifier for Inconsistent XML Document

Integrity constraints are rules for correct and sound data. But for many reasons, XML document violating its integrity constraints, which is called inconsistent XML, widely exist in application. Verifying consistency and finding conflict nodes for XML document are important in many applications.Here we propose a verifier for XML document. It scans the original XML document once, and can deal with different types of constraints such as domain restriction, functional dependency, key dependency, inclusion dependency dependency. It can link all nodes conflicting with each other of the XML document. Our experimental evaluation shows that even when XML documents are large,with high percentage of dirty elements, and against many different types of constraints, the verifier can complete computing in O(c*n*m), where c is the number of constraints,n is the size of XML elements, and m is the maximum number of variable bindings in the set of constraints. It is less than O(n
²
) w.r.t the size of XML elements in most situation.