skip to main content
10.1145/1265530.1265542acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Expressiveness and complexity of xml publishing transducers

Authors Info & Claims
Published:11 June 2007Publication History

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.

Skip Supplemental Material Section

Supplemental Material

Low Resolution
High Resolution

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational atabases. TOCL, 4, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Arenas and L. Libkin. XML data exchange: consistency and query answering. In PODS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Benedikt and C. Koch. Interpreting tree-to-tree queries. In ICALP, pages 552--564, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Benedikt, C. Chan, W. Fan, R. Rastogi, S. Zheng and A. Zhou. DTD-directed publishing with attribute translation grammars. In VLDB, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Bohannon, B. Choi, and W. Fan. Incremental evaluation of schema-directed XML publishing. In SIGMOD, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Fagin, P. Kolaitis, and L. Popa. Data exchange: getting to the core. TODS, 30(1):174--210, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Flum and H. Ebbinghaus. Finite Model Theory. Springer, 2nd edition, 1999.Google ScholarGoogle Scholar
  13. F. Gécseg and M. Steinby. Tree languages. In Handbook of Formal Languages, volume 3. Springer, 1996.Google ScholarGoogle Scholar
  14. E. Grädel. On Transitive Closure Logic. In CSL, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  15. IBM. DB2 XML Extender. http://www-3.ibm.com/software/data/db2/extended/xmlext/.Google ScholarGoogle Scholar
  16. R. Krishnamurthy, R. Kaushik, and J. F. Naughton. XMLSQL query translation literature: The state of the art and open problems. In Xsym, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  17. L. Libkin. Elements of Finite Model Theory. Springer, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. B. Ludäscher, P. Mukhopadhyay, and Y. Papakonstantinou. A transducer-based XML query processor. In VLDB, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  19. Microsoft. XML support in microsoft SQL server 2005, 2005 msdn.microsoft.com/library/en-us/dnsql90/html/sql2k5xml.asp/.Google ScholarGoogle Scholar
  20. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. JCSS, 66(1):66--97, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. F. Neven. On the power of walking for querying treestructured data. In PODS, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. F. Neven and T. Schwentick. Query automata over finite trees. TCS, 275(1-2):633--674, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Oracle. Oracle Database 10g Release 2 XML DB Whitepaper. http://www.oracle.com/technology/tech/xml/ xmldb/index.html.Google ScholarGoogle Scholar
  24. C. H. Papadimitriou. Computational Complexity. AW, 1994.Google ScholarGoogle Scholar
  25. Y. Papakonstantinou and V. Vianu. Type inference for views of semistructured data. In PODS, 2000.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. M. Spielmann. Abstract State Machines: Verification Problems and Complexity. PhD thesis, RWTH Aachen, 2000.Google ScholarGoogle Scholar
  28. R. van der Meyden. The complexity of querying indefinite data about linearly ordered domains. JCSS, 54(1), 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. M. Y. Vardi. The complexity of relational query languages (extended abstract). In STOC, pages 137--146, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Expressiveness and complexity of xml publishing transducers

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
            June 2007
            328 pages
            ISBN:9781595936851
            DOI:10.1145/1265530

            Copyright © 2007 ACM

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 11 June 2007

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate476of1,835submissions,26%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!