BOOKS
BOOK SERIES
JOURNALS
PROCEEDINGS
TEACHING CASES
PAY-PER-VIEW
REFERENCE
E-RESOURCES
ABOUT IGI
BECOME AN AUTHOR/EDITOR  |   MAILING LIST  |   HOW TO ORDER  |   LIBRARY SUGGESTION | EXAMINATION REQUESTS/COURSE ADOPTION | DISTRIBUTORS
IGI Online Bookstore
Click here to PLAY Demo Click here to Start Search Search 30,000+ chapters, articles, and cases - available for download today!

IGI Global Online Symposium!



  Browse Our Bookstore
IGI Catalogs & Newsletters
Forthcoming Titles
Featured Book
By Category
Advanced Search

  Shop
My Profile
View My Cart

  Contact Us
IGI Global
Main Office
701 E. Chocolate Avenue
Hershey, PA 17033, USA
Tel: 717-533-8845 x100
Toll Free: 1-866-342-6657
Fax: 717-533-8661
    or 717-533-7115
 

Semantic Integrity Constraint Checking for Multiple XML Databases:
Our Price:    $30.00 US
Article #:    ITJ3285
Number of pages:    1-19 pages
Source:    Journal of Database Management, Vol. 17, Issue 4
Author(s):    Madiraju, Praveen; Sunderraman, Rajshekhar; Navathe, Shamkant B.; Wang, Haibin
Affiliation(s):    Marquette University, USA; Georgia State University, USA; Georgia Institute of Technology, USA; Georgia Institute of Technology, USA

Order Now! This document will be delivered electronically. Terms of Delivery
 

Description
Global semantic integrity constraints ensure integrity and consistency of data spanning multiple databases. In this paper, we take initial steps towards representing global semantic integrity constraints for XML databases. We also provide a general framework for checking global semantic integrity constraints for XML databases. Furthermore, we set forth an efficient algorithm for checking global semantic integrity constraints across multiple XML databases. Our 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.

 
Books  |  Book Series  |  Journals  |  Proceedings  |  Teaching Cases  |  Pay-Per-View  |  Reference  |  E-Resources  |  About IGI
Become An Author/Editor  |  Mailing List  |  How To Order  |  Library Suggestion  |  Examination Requests

IGI Global - All Rights Reserved ©2001-2010