Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Hilbert's tenth problem
Making object-oriented schemas more expressive
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
XML-based information mediation with MIX
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
On the complexity of integer programming
Journal of the ACM (JACM)
Regular path queries with constraints
Journal of Computer and System Sciences
Path constraints in semistructured databases
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Proceedings of the 10th international conference on World Wide Web
On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficiently Publishing Relational Data as XML Documents
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Verifying Integrity Constraints on Web Sites
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Integrating and customizing heterogeneous e-commerce applications
The VLDB Journal — The International Journal on Very Large Data Bases
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Constraints-preserving transformation from XML document type deffinition to relational schema
ER'00 Proceedings of the 19th international conference on Conceptual modeling
On Reasoning about Structural Equality in XML: A Description Logic Approach
ICDT '03 Proceedings of the 9th International Conference on Database Theory
What's Hard about XML Schema Constraints?
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
A Web odyssey: from codd to XML
ACM SIGMOD Record
Capturing both types and constraints in data integration
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Interaction between path and type constraints
ACM Transactions on Computational Logic (TOCL)
Information Systems
TQL: a query language for semistructured data based on the ambient logic
Mathematical Structures in Computer Science
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
Propagating XML constraints to relations
Journal of Computer and System Sciences
Dependency-preserving normalization of relational and XML data
Journal of Computer and System Sciences
XML design for relational storage
Proceedings of the 16th international conference on World Wide Web
Consistent data for inconsistent XML document
Information and Software Technology
ACCOn: checking consistency of XML write-access control policies
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantics in Data and Knowledge Bases
Semantics in Data and Knowledge Bases
Static analysis of active XML systems
ACM Transactions on Database Systems (TODS)
Functional dependencies for XML
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Comparing workflow specification languages: a matter of views
Proceedings of the 14th International Conference on Database Theory
Dependency-preserving normalization of relational and XML data
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Querying and repairing inconsistent XML data
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Meta modeling approach for XML based data integration
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Consistency of XML specifications
Inconsistency Tolerance
Comparing workflow specification languages: A matter of views
ACM Transactions on Database Systems (TODS)
Type-based detection of XML query-update independence
Proceedings of the VLDB Endowment
A faceted taxonomy of semantic integrity constraints for the XML data model
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
XML normalization based on entity segments
Information Sciences: an International Journal
Hi-index | 0.00 |
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsistent, and thus it is often desirable to check consistency at compile-time. It is known that for general keys and foreign keys, and DTDs, the consistency problem is undecidable; however, it becomes NP-complete when all keys are one-attribute (unary), and tractable, if no foreign keys are used.In this paper, we consider a variety of constraints for XML data, and study the complexity of the consistency problem. Our main conclusion is that in the presence of foreign keys, compile-time verification of consistency is usually infeasible. We look at two types of constraints: absolute (that hold in the entire document), and relative (that only hold in a part of the document). For absolute constraints, we extend earlier decidability results to the case of multi-attribute keys and unary foreign keys, and to the case of constraints involving regular expressions, providing lower and upper bounds in both cases. For relative constraints, we show that even for unary constraints, the consistency problem is undecidable. We also establish a number of restricted decidable cases.