Deciding equivalence of finite tree automata
SIAM Journal on Computing
The complexity of word problems—this time with interleaving
Information and Computation
Haskell overloading is DEXPTIME-complete
Information Processing Letters
One-unambiguous regular languages
Information and Computation
Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science
The complexity theory companion
The complexity theory companion
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Answering XML Queries on Heterogeneous Data Sources
Proceedings of the 27th International Conference on Very Large Data Bases
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Unambiguity of Extended Regular Expressions in SGML Document Grammars
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Towards efficient implementation of XML schema content models
Proceedings of the 2004 ACM symposium on Document engineering
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML Schema
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Minimizing tree automata for unranked trees
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Simple off the shelf abstractions for XML schema
ACM SIGMOD Record
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inclusion Test Algorithms for One-Unambiguous Regular Expressions
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Efficient asymmetric inclusion between regular expression types
Proceedings of the 12th International Conference on Database Theory
Efficient inclusion for a class of XML types with interleaving and counting
Information Systems
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
Checking determinism of XML Schema content models in optimal time
Information Systems
Projection for XML update optimization
Proceedings of the 14th International Conference on Extending Database Technology
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Type-based detection of XML query-update independence
Proceedings of the VLDB Endowment
Almost-linear inclusion for XML regular expression types
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
The presence of a schema offers many advantages in processing, translating, querying, and storage of XML data. Basic decision problems like equivalence, inclusion, and non-emptiness of intersection of schemas form the basic building blocks for schema optimization and integration, and algorithms for static analysis of transformations. It is thereby paramount to establish the exact complexity of these problems. Most common schema languages for XML can be adequately modeled by some kind of grammar with regular expressions at right-hand sides. In this paper, we observe that apart from the usual regular operators of union, concatenation and Kleene-star, schema languages also allow numerical occurrence constraints and interleaving operators. Although the expressiveness of these operators remain within the regular languages, their presence or absence has significant impact on the complexity of the basic decision problems. We present a complete overview of the complexity of the basic decision problems for DTDs, XSDs and Relax NG with regular expressions incorporating numerical occurrence constraints and interleaving. We also discuss chain regular expressions and the complexity of the schema simplification problem incorporating the new operators.