SIAM Journal on Computing
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
One-unambiguous regular languages
Information and Computation
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Handbook of Formal Languages
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Prime decompositions of regular languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Proceedings of the 14th International Conference on Database Theory
On language decompositions and primality
Rainbow of computer science
Journal of Computer and System Sciences
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Language Equations with Symmetric Difference
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
On simplification of schema mappings
Journal of Computer and System Sciences
Hi-index | 0.00 |
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distribution of such documents immediately raises the following question: how can a global schema for the distributed document be broken up into local schemas for the different logical parts? The desired set of local schemas should guarantee that, if each logical part satisfies its local schema, then the distributed document satisfies the global schema. Abiteboul et al. proposed three levels of desirability for local schemas: local typing, maximal local typing, and perfect local typing. Immediate algorithmic questions are: (i) given a typing, determine whether it is local, maximal local, or perfect, and (ii) given a document and a schema, establish whether a (maximal) local or perfect typing exists. This paper improves the open complexity results in their work and initiates the study of (i) and (ii) for schema restrictions arising from the current standards: DTDs and XML Schemas with deterministic content models. The most striking result is that these restrictions yield tractable complexities for the perfect typing problem. Furthermore, an open problem in Formal Language Theory is settled: deciding language primality for deterministic finite automata is pspace-complete.