ABSTRACT
A number of languages have been developed for specifying XML publishing, i.e., transformations of relational data into XML trees. These languages generally describe the behaviors of a middleware controller that builds an output tree iteratively, issuing queries to a relational source and expanding the tree with the query results at each step. To study the complexity and expressive power of XML publishing languages, this paper proposes a notion of publishing transducers. Unlike automata for querying XML data, a publishing transducer generates a new XML tree rather than performing a query on an existing tree. We study a variety of publishing transducers based on what relational queries a transducer can issue, what temporary stores a transducer can use during tree generation, and whether or not some tree nodes are allowed to be virtual, i.e., excluded from the output tree. We first show how existing XML publishing languages can be characterized by such transducers. We then study the members ip, emptiness and equivalence problems for various classes of transducers and existing publishing languages. We establish lower and upper bounds, all matching except one, ranging from PTIME to undecidable. Finally, we investigate the expressive power of these transducers and existing languages. We show that when treated as relational query languages, different classes of transducers capture either complexity classes (e.g., PSPACE) or fragments of datalog (e.g., linear datalog). For tree generation, we establish connections between publishing transducers and logical transductions.
Supplemental Material
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational atabases. TOCL, 4, 2003. Google Scholar
Digital Library
- M. Arenas and L. Libkin. XML data exchange: consistency and query answering. In PODS, 2005. Google Scholar
Digital Library
- M. Benedikt and C. Koch. Interpreting tree-to-tree queries. In ICALP, pages 552--564, 2006. Google Scholar
Digital Library
- M. Benedikt, C. Chan, W. Fan, R. Rastogi, S. Zheng and A. Zhou. DTD-directed publishing with attribute translation grammars. In VLDB, 2002.Google Scholar
Digital Library
- P. Bohannon, B. Choi, and W. Fan. Incremental evaluation of schema-directed XML publishing. In SIGMOD, 2004. Google Scholar
Digital Library
- E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, 1997.Google Scholar
Cross Ref
- B. Courcelle. Monadic second-order definable graph transductions: A survey. TCS, 126(1):53--75, 1994.B. Courcelle. Monadic second-order definable graph transductions: A survey. TCS, 126(1):53--75, 1994. Google Scholar
Digital Library
- E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. ACM Comput. Surv, 33(3):374--425, 2001. Google Scholar
Digital Library
- R. Fagin, P. Kolaitis, and L. Popa. Data exchange: getting to the core. TODS, 30(1):174--210, 2005. Google Scholar
Digital Library
- M. F. Fernandez, Y. Kadiyska, D. Suciu, A. Morishima, and W. C. Tan. SilkRoute: A framework for publishing relational data in XML. TODS, 27(4):438--493, 2002. Google Scholar
Digital Library
- J. Flum and H. Ebbinghaus. Finite Model Theory. Springer, 2nd edition, 1999.Google Scholar
- F. Gécseg and M. Steinby. Tree languages. In Handbook of Formal Languages, volume 3. Springer, 1996.Google Scholar
- E. Grädel. On Transitive Closure Logic. In CSL, 1992.Google Scholar
Cross Ref
- IBM. DB2 XML Extender. http://www-3.ibm.com/software/data/db2/extended/xmlext/.Google Scholar
- R. Krishnamurthy, R. Kaushik, and J. F. Naughton. XMLSQL query translation literature: The state of the art and open problems. In Xsym, 2003.Google Scholar
Cross Ref
- L. Libkin. Elements of Finite Model Theory. Springer, 2004. Google Scholar
Digital Library
- B. Ludäscher, P. Mukhopadhyay, and Y. Papakonstantinou. A transducer-based XML query processor. In VLDB, 2002.Google Scholar
Cross Ref
- Microsoft. XML support in microsoft SQL server 2005, 2005 msdn.microsoft.com/library/en-us/dnsql90/html/sql2k5xml.asp/.Google Scholar
- T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. JCSS, 66(1):66--97, 2003. Google Scholar
Digital Library
- F. Neven. On the power of walking for querying treestructured data. In PODS, 2002. Google Scholar
Digital Library
- F. Neven and T. Schwentick. Query automata over finite trees. TCS, 275(1-2):633--674, 2002. Google Scholar
Digital Library
- Oracle. Oracle Database 10g Release 2 XML DB Whitepaper. http://www.oracle.com/technology/tech/xml/ xmldb/index.html.Google Scholar
- C. H. Papadimitriou. Computational Complexity. AW, 1994.Google Scholar
- Y. Papakonstantinou and V. Vianu. Type inference for views of semistructured data. In PODS, 2000.Google Scholar
Digital Library
- J. Shanmugasundaram, E. Shekita, R. Barr, M. Carey, B. Lindsay, H. Pirahesh, and B. Reinwald. Efficiently publishing relational data as XML documents. VLDB J., 10(2-3):133--154, 2001. Google Scholar
Digital Library
- M. Spielmann. Abstract State Machines: Verification Problems and Complexity. PhD thesis, RWTH Aachen, 2000.Google Scholar
- R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. JCSS, 54(1), 1997. Google Scholar
Digital Library
- M. Y. Vardi. The complexity of relational query languages (extended abstract). In STOC, pages 137--146, 1982. Google Scholar
Digital Library
Index Terms
Expressiveness and complexity of xml publishing transducers
Recommendations
Expressiveness and complexity of XML publishing transducers
A number of languages have been developed for specifying XML publishing, that is, transformations of relational data into XML trees. These languages generally describe the behaviors of a middleware controller that builds an output tree iteratively, ...
Expressiveness of propositional projection temporal logic with star
This paper investigates the expressiveness of Propositional Projection Temporal Logic with Star (PPTL*). To this end, Buchi automata and @w-regular expressions are first extended as Stutter Buchi Automata (SBA) and Extended Regular Expressions (ERE) to ...
The Complexity of Compositions of Deterministic Tree Transducers
FST TCS '02: Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer ScienceMacro tree transducers can simulate most models of tree transducers (e.g., top-down and bottom-up tree transducers, attribute grammars, and pebble tree transducers which, in turn, can simulate all known models of XML transformers). The string languages ...






Comments