Problems complete for deterministic logarithmic space
Journal of Algorithms
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Distributed Database Systems: Where Are We Now?
Computer - Distributed computing systems: separate resources acting as one
SIAM Journal on Computing
One-unambiguous regular languages
Information and Computation
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Web Modeling Language (WebML): a modeling language for designing Web sites
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
WebDAV: what it is, what it does, why you need it
SIGUCCS '03 Proceedings of the 31st annual ACM SIGUCCS fall conference
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
The Active XML project: an overview
The VLDB Journal — The International Journal on Very Large Data Bases
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
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Functional dependencies for XML
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Schema design for XML repositories: complexity and tractability
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
A framework for distributed XML data management
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Hi-index | 0.00 |
A distributed XML document is an XML document that spans several machines. We assume that a distribution design of the document tree is given, consisting of an XML kernel-documentT"["f"""1","...","f"""n"] where some leaves are ''docking points'' for external resources providing XML subtrees (f"1,...,f"n, standing, e.g., for Web services or peers at remote locations). The top-down design problem consists in, given a type (a schema document that may vary from a DTD to a tree automaton) for the distributed document, ''propagating'' locally this type into a collection of types, that we call typing, while preserving desirable properties. We also consider the bottom-up design which consists in, given a type for each external resource, exhibiting a global type that is enforced by the local types, again with natural desirable properties. In the article, we lay out the fundamentals of a theory of distributed XML design, analyze problems concerning typing issues in this setting, and study their complexity.