The Community for Technology Leaders
2012 15th International Conference on Network-Based Information Systems (2012)
Melbourne, Australia Australia
Sept. 26, 2012 to Sept. 28, 2012
ISBN: 978-1-4673-2331-4
pp: 24-31
In this paper, we propose a checking algorithm for dynamic constraint validation during XML updates. Our algorithm is targeted at single transition constraint, which is affected by single node updating. To the best of our knowledge, almost all constraints that have been preserved in the previous XML updates works are for static constraints. On the other hand, dynamic constraints restrict the transition of data from a current state into a new state. The operations that can affect these constraints involve node replacement, value of element and attribute replacement, and insert-delete pairing operations of nodes and their values. We propose a lightweight XML file to store only required data for the validation, i.e. states that need to be changed are extracted from XQuery and original XML documents. For experimentation purposes, we apply the algorithm in Java platform with the support of Schematron for the dynamic constraint and BaseX for parsing XQuery statements. The analysis shows our algorithm performs in cubic growth while still in polynomial efficiency. Nevertheless, our proposed dynamic constraint file is not minimal enough if the query involves indirect states transitions caused by sub queries. We would like to continue and extend the work with more types of dynamic constraint.
XML, Databases, Heuristic algorithms, Information systems, Remuneration, Algorithm design and analysis, validation, business rule, static constraint, dynamic constraint, single transition constraint, XML update

N. Wahid and E. Pardede, "Single Transition Constraint for XML Update Validation," 2012 15th International Conference on Network-Based Information Systems(NBIS), Melbourne, Australia Australia, 2012, pp. 24-31.
90 ms
(Ver 3.3 (11022016))