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
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
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
Regular rewriting of active XML and unambiguity
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Active XML project: an overview
The VLDB Journal — The International Journal on Very Large Data Bases
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
A framework for distributed XML data management
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Schema design for XML repositories: complexity and tractability
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimal tree language extensions: a keystone of XML type compatibility and evolution
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Proceedings of the 14th International Conference on Database Theory
Journal of Computer and System Sciences
Scaling XML query processing: distribution, localization and pruning
Distributed and Parallel Databases
On the improvement of active XML (AXML) representation and query evaluation
Information Systems Frontiers
On simplification of schema mappings
Journal of Computer and System Sciences
Conservative type extensions for XML data
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.00 |
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML tree some of whose leaves are "docking points", to which XML subtrees can be attached. These subtrees may be provided and controlled by peers at remote locations, or may correspond to the result of function calls, e.g., Web services. If a global type τ, e.g. a DTD, is specified for a distributed document T, it would be most desirable to be able to break this type into a collection of local types, called a local typing, such that the document satisfies τ if and only if each peer (or function) satisfies its local type. In this paper we lay out the fundamentals of a theory of local typing and provide formal definitions of three main variants of locality: local typing, maximal local typing, and perfect typing, the latter being the most desirable. We study the following relevant decision problems: (i) given a typing for a design, determine whether it is local, maximal local, or perfect; (ii) given a design, establish whether a (maximal) local, or perfect typing does exist. For some of these problems we provide tight complexity bounds (polynomial space), while for the others we show exponential upper bounds. A main contribution is a polynomial-space algorithm for computing a perfect typing in this context, if it exists.