Welcome to the InfoSci Platform
Integrity Constraint Checking for Multiple XML Databases

Integrity Constraint Checking for Multiple XML Databases

Praveen Madiraju, Rajshekhar Sunderraman, Shamkant B. Navathe, Haibin Wang
Copyright: © 2009 |Pages: 20
ISBN13: 9781605661728|ISBN10: 1605661724|ISBN13 Softcover: 9781616926038|EISBN13: 9781605661735
DOI: 10.4018/978-1-60566-172-8.ch010
Cite Chapter Cite Chapter

MLA

Madiraju, Praveen, et al. "Integrity Constraint Checking for Multiple XML Databases." Advanced Principles for Improving Database Design, Systems Modeling, and Software Development, edited by Keng Siau and John Erickson, IGI Global, 2009, pp. 158-177. https://doi.org/10.4018/978-1-60566-172-8.ch010

APA

Madiraju, P., Sunderraman, R., Navathe, S. B., & Wang, H. (2009). Integrity Constraint Checking for Multiple XML Databases. In K. Siau & J. Erickson (Eds.), Advanced Principles for Improving Database Design, Systems Modeling, and Software Development (pp. 158-177). IGI Global. https://doi.org/10.4018/978-1-60566-172-8.ch010

Chicago

Madiraju, Praveen, et al. "Integrity Constraint Checking for Multiple XML Databases." In Advanced Principles for Improving Database Design, Systems Modeling, and Software Development, edited by Keng Siau and John Erickson, 158-177. Hershey, PA: IGI Global, 2009. https://doi.org/10.4018/978-1-60566-172-8.ch010

Export Reference

Mendeley
Favorite

Abstract

Global semantic integrity constraints ensure the integrity and consistency of data spanning distributed databases. In this chapter, we discuss a novel representation technique for expressing semantic integrity constraints for XML databases. We also provide the details of XConstraint Checker, a general framework for checking global semantic constraints for XML databases. The framework is augmented with an efficient algorithm for checking these global XML constraints. The algorithm is efficient for three reasons: 1) the algorithm does not require the update statement to be executed before the constraint check is carried out; hence, we avoid any potential problems associated with rollbacks, 2) sub constraint checks are executed in parallel, and 3) most of the processing of algorithm could happen at compile time; hence, we save time spent at run-time. As a proof of concept, we present a prototype of the system implementing the ideas discussed in this paper.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.