Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
Understanding the new SQL: a complete guide
Understanding the new SQL: a complete guide
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
Handbook of formal languages, vol. 1
XML-based information mediation with MIX
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Regular path queries with constraints
Journal of Computer and System Sciences
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A normal form for XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On verifying consistency of XML specifications
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
Schemas for Integration and Translation of Structured and Semi-structured Data
ICDT '99 Proceedings of the 7th International Conference on Database Theory
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
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
What's Hard about XML Schema Constraints?
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
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
Capturing both types and constraints in data integration
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Object/relational query optimization with chase and backchase
Object/relational query optimization with chase and backchase
Interaction between path and type constraints
ACM Transactions on Computational Logic (TOCL)
Information Systems
Constraints-preserving transformation from XML document type deffinition to relational schema
ER'00 Proceedings of the 19th international conference on Conceptual modeling
Two-variable logic on data trees and XML reasoning
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM SIGMOD Record
Testing XML constraint satisfiability
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about XML update constraints
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantics in Data and Knowledge Bases
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Reasoning about XML update constraints
Journal of Computer and System Sciences
On notions of regularity for data languages
Theoretical Computer Science
On pebble automata for data languages with decidable emptiness problem
Journal of Computer and System Sciences
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
Specifications of XML documents typically consist of typing information (for example, a DTD), and integrity constraints (for example, keys and foreign keys). We show that combining the two may lead to seemingly reasonable specifications that are nevertheless inconsistent: there is no XML document that both conforms to the DTD and satisfies the constraints. We then survey results on the complexity of consistency checking, and show that, depending on the classes of DTDs and constraints involved, it ranges from linear time to undecidable. Furthermore, we show that for some of the most common classes of specifications checking consistency is intractable.