skip to main content
10.1145/1807085.1807117acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Schema design for XML repositories: complexity and tractability

Published:06 June 2010Publication History

ABSTRACT

Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distribution of such documents immediately raises the following question: how can a global schema for the distributed document be broken up into local schemas for the different logical parts? The desired set of local schemas should guarantee that, if each logical part satisfies its local schema, then the distributed document satisfies the global schema.

Abiteboul et al. proposed three levels of desirability for local schemas: local typing, maximal local typing, and perfect local typing. Immediate algorithmic questions are: (i) given a typing, determine whether it is local, maximal local, or perfect, and (ii) given a document and a schema, establish whether a (maximal) local or perfect typing exists. This paper improves the open complexity results in their work and initiates the study of (i) and (ii) for schema restrictions arising from the current standards: DTDs and XML Schemas with deterministic content models. The most striking result is that these restrictions yield tractable complexities for the perfect typing problem.

Furthermore, an open problem in Formal Language Theory is settled: deciding language primality for deterministic finite automata is pspace-complete.

References

  1. S. Abiteboul, G. Gottlob, and M. Manna. Distributed XML design. In ACM PODS, pages 247--258, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S.V. Avgustinovich and A. Frid. A unique decomposition theorem for factorial languages. Int. J. of Algebra and Comput., 15:149--160, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  3. Sebastian Bala. Regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms. In STACS, pages 596--607, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  4. G. J. Bex, W. Gelade, W. Martens, and F. Neven. Simplifying XML Schema: effortless handling of nondeterministic regular expressions. In ACM SIGMOD, pages 731--744, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Bray, J. Paoli, C. M. Sperberg-McQueen, E. Maler, and F. Yergeau. Extensible Markup Language XML 1.0 (fifth edition). Technical report, World Wide Web Consortium (W3C), November 2008. W3C Recommendation, http://www.w3.org/TR/2008/REC-xml-20081126/.Google ScholarGoogle Scholar
  6. A. Brüggemann-Klein and D. Wood. One-unambiguous regular languages. Inf. and Comput., 142(2):182--206, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Calvanese, G. De Giacomo, M. Lenzerini, and M.Y. Vardi. Rewriting of regular expressions and regular path queries. J. Comp. Syst. Sc., 64(3):443--465, 2002.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Clark and M. Murata. Relax NG specification. http://www.relaxng.org/spec-20011203.html, December 2001.Google ScholarGoogle Scholar
  9. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.Google ScholarGoogle Scholar
  10. J. Czyzowicz, W. Fraczak, A. Pelc, and W. Rytter. Linear-time prime decompositions of regular prefix codes. Int. J. Found. Comp. Sc., 14:1019--1031, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  11. D. Fallside and P. Walmsley. XML Schema Part 0: Primer (second edition). Technical report, World Wide Web Consortium, October 2004. http://www.w3.org/TR/2004/REC-xmlschema-0-20041028/.Google ScholarGoogle Scholar
  12. S. Gao, C. M. Sperberg-McQueen, H.S. Thompson, N. Mendelsohn, D. Beech, and M. Maloney. W3C XML Schema Definition Language (XSD) 1.1 part 1: Structures. Technical report, World Wide Web Consortium, April 2009. W3C Recommendation, http://www.w3.org/TR/2009/CR-xmlschema11-1-20090430/.Google ScholarGoogle Scholar
  13. Y.-S. Han, K. Salomaa, and D. Wood. Prime decompositions of regular languages. In DLT, pages 145--155, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. Jiang and B. Ravikumar. Minimal NFA problems are hard. Siam J. Comp., 22(6):1117--1141, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Kunc. What do we know about language equations? In DLT, pages 23--27, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for XML schemas and chain regular expressions. Siam J. Comp., 39(4):1486--1530, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In ACM PODS, pages 35--46, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Salomaa, K. Salomaa, and S. Yu. Length codes, products of languages and primality. In LATA, pages 476--486, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Salomaa and S. Yu. On the decomposition of finite languages. In DLT, pages 22--31, 1999.Google ScholarGoogle Scholar
  20. K. Salomaa. Language decompositions, primality, and trajectory-based operations. In CIAA, pages 17--22, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. P. van Emde Boas. The convenience of tilings. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics, pages 331--363. Marcel Dekker Inc., 1997.Google ScholarGoogle Scholar
  22. M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In BANFF, pages 238--266, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. W. Wieczorek. An algorithm for the decomposition of finite languages. Logic J. of the IGPL, 2009. Appeared on-line August 8, 2009.Google ScholarGoogle Scholar
  24. S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 2. Springer, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Schema design for XML repositories: complexity and tractability

            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 '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
              June 2010
              350 pages
              ISBN:9781450300339
              DOI:10.1145/1807085

              Copyright © 2010 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 6 June 2010

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-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!