Semantic Integrity Constraint Checking for Multiple XML Databases

2009 ◽  
pp. 550-569
Author(s):  
Praveen Madiraju ◽  
Rajshekhar Sunderraman ◽  
Shamkant B. Navathe ◽  
Haibin Wang
Keyword(s):  
Efficient Algorithm ◽  
General Framework ◽  
Integrity Constraints ◽  
Integrity Constraint ◽  
Proof Of Concept ◽  
Xml Databases ◽  
Constraint Checking ◽  
Potential Problems ◽  
Run Time

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.

Integrity Constraint Checking for Multiple XML Databases

2009 ◽  
pp. 158-177
Author(s):  
Praveen Madiraju ◽  
Rajshekhar Sunderraman ◽  
Shamkant B. Navathe ◽  
Haibin Wang
Keyword(s):  
Efficient Algorithm ◽  
General Framework ◽  
Distributed Databases ◽  
Integrity Constraints ◽  
Integrity Constraint ◽  
Xml Databases ◽  
Semantic Constraints ◽  
Constraint Checking ◽  
Potential Problems ◽  
Representation Technique

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.

scholarly journals Integrity Constraint Checking in Distributed Nested Transactions over a Database Cluster

2006 ◽  
Vol 9 (2) ◽  
Author(s):  
Stephane Gançarski ◽  
Claudia León ◽  
Hubert Naacke ◽  
Marta Rukoz ◽  
Pablo Santini
Keyword(s):  
Distributed Systems ◽  
Database System ◽  
Integrity Constraints ◽  
Global Constraints ◽  
Integrity Constraint ◽  
Nested Transactions ◽  
Pc Cluster ◽  
Constraint Checking ◽  
Database Cluster ◽  
Referential Integrity

This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experimental results obtained by implementing this solution over a PC cluster with Oracle9i DBMS. The goal of those experimentations is to measure the time spent to check global constraints in a distributed systems. The results show that the overhead induced by our distributed constraint checking is reduced by 50% compared to a centralized checking of constraints.

Semantic Integrity Constraint Checking for Multiple XML Databases

2006 ◽  
Vol 17 (4) ◽  
pp. 1-19 ◽  
Author(s):  
Praveen Madiraju ◽  
Rajshekhar Sunderraman ◽  
Shamkant B. Navathe ◽  
Haibin Wang
Keyword(s):  
Integrity Constraint ◽  
Xml Databases ◽  
Constraint Checking

scholarly journals Improving the Smoothed Complexity of FLIP for Max Cut Problems

2021 ◽  
Vol 17 (3) ◽  
pp. 1-38
Author(s):  
Ali Bibak ◽  
Charles Carlson ◽  
Karthekeyan Chandrasekaran
Keyword(s):  
General Framework ◽  
Edge Weight ◽  
Complete Graphs ◽  
Worst Case ◽  
Weight Density ◽  
Complete Problems ◽  
Substantial Progress ◽  
Run Time ◽  
Optimum Solution ◽  
Arbitrary Graphs

Finding locally optimal solutions for MAX-CUT and MAX- k -CUT are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in worst-case instances, it tends to terminate quickly in practical instances. To explain this discrepancy, the run-time of FLIP has been studied in the smoothed complexity framework. Etscheid and Röglin (ACM Transactions on Algorithms, 2017) showed that the smoothed complexity of FLIP for max-cut in arbitrary graphs is quasi-polynomial. Angel, Bubeck, Peres, and Wei (STOC, 2017) showed that the smoothed complexity of FLIP for max-cut in complete graphs is ( O Φ 5 n 15.1 ), where Φ is an upper bound on the random edge-weight density and Φ is the number of vertices in the input graph. While Angel, Bubeck, Peres, and Wei’s result showed the first polynomial smoothed complexity, they also conjectured that their run-time bound is far from optimal. In this work, we make substantial progress toward improving the run-time bound. We prove that the smoothed complexity of FLIP for max-cut in complete graphs is O (Φ n 7.83 ). Our results are based on a carefully chosen matrix whose rank captures the run-time of the method along with improved rank bounds for this matrix and an improved union bound based on this matrix. In addition, our techniques provide a general framework for analyzing FLIP in the smoothed framework. We illustrate this general framework by showing that the smoothed complexity of FLIP for MAX-3-CUT in complete graphs is polynomial and for MAX - k - CUT in arbitrary graphs is quasi-polynomial. We believe that our techniques should also be of interest toward showing smoothed polynomial complexity of FLIP for MAX - k - CUT in complete graphs for larger constants k .

scholarly journals Extended tuple constraint type as a complex integrity constraint type in XML data model - definition and enforcement

2018 ◽  
Vol 15 (3) ◽  
pp. 821-843
Author(s):  
Jovana Vidakovic ◽  
Sonja Ristic ◽  
Slavica Kordic ◽  
Ivan Lukovic
Keyword(s):  
Data Model ◽  
Relational Databases ◽  
Database Management System ◽  
Integrity Constraints ◽  
Relational Data ◽  
Integrity Constraint ◽  
Xml Data ◽  
Relational Data Model ◽  
Unique Constraint ◽  
Schema Languages

A database management system (DBMS) is based on a data model whose concepts are used to express a database schema. Each data model has a specific set of integrity constraint types. There are integrity constraint types, such as key constraint, unique constraint and foreign key constraint that are supported by most DBMSs. Other, more complex constraint types are difficult to express and enforce and are mostly completely disregarded by actual DBMSs. The users have to manage those using custom procedures or triggers. eXtended Markup Language (XML) has become the universal format for representing and exchanging data. Very often XML data are generated from relational databases and exported to a target application or another database. In this context, integrity constraints play the essential role in preserving the original semantics of data. Integrity constraints have been extensively studied in the relational data model. Mechanisms provided by XML schema languages rely on a simple form of constraints that is sufficient neither for expressing semantic constraints commonly found in databases nor for expressing more complex constraints induced by the business rules of the system under study. In this paper we present a classification of constraint types in relational data model, discuss possible declarative mechanisms for their specification and enforcement in the XML data model, and illustrate our approach to the definition and enforcement of complex constraint types in the XML data model on the example of extended tuple constraint type.

Sign in / Sign up

Export Citation Format

Share Document