One-unambiguous regular languages
Information and Computation
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Exchanging intensional XML data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Lazy query evaluation for Active XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Consistent data for inconsistent XML document
Information and Software Technology
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
Active XML (AXML) intensional data exchange
Proceedings of the 13th International Conference on Information Integration and Web-based Applications and Services
On optimum left-to-right strategies for active context-free games
Proceedings of the 16th International Conference on Database Theory
Journal of Network and Computer Applications
| Hi-index | 0.00 |
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to Web services. Peers exchanging AXML data agree on a data exchange schema that specifies in particular which parts of the data are allowed to be intensional. Before sending a document, a peer may need to rewrite it to match the agreed data exchange schema, by calling some of the services and materializing their data. Previous works showed that the rewriting problem is undecidable in the general case and of high complexity in some restricted cases. We argue here that this difficulty is somewhat artificial. Indeed, we study what we believe to be a more adequate, from a practical view point, rewriting problem that is (1) in the spirit of standard 1-unambiguity constraints imposed on XML schema and (2) can be solved by a single pass over the document with a computational device not stronger than a finite state automation. Following previous works, we focus on the core of the problem, i.e., on the problem on words. The results may be extended to (A)XML trees in a straightforward manner.