Optimizing schema languages for XML: Numerical constraints and interleaving

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 2021-2043

  Gelade, Wouter ^a,b   Martens, Wim ^c   Neven, Frank ^a  

^a HASSELT UNIVERSITY   (Belgium)

^b RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Complexity; Optimization; Regular expressions; XML schema languages

Indexed keywords

BASIC BUILDING BLOCK; COMPLEXITY; DECISION PROBLEMS; NUMERICAL CONSTRAINTS; REGULAR EXPRESSIONS; REGULAR OPERATORS; RELAX NG; RIGHT-HAND SIDES; SCHEMA LANGUAGE; SCHEMAS; SIGNIFICANT IMPACTS; XML DATA; XML SCHEMA LANGUAGES;

OPTIMIZATION;

XML;

EID: 77953746107     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070697367     Document Type: Article

References (44)

1. S. Abiteboul, P. Buneman, and D. Suciu, Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann, San Francisco, 1999.
2. M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, J. ACM, 55 (2008), article 8.
3. G. J. Bex, F. Neven, T. Schwentick, and K. Tuyls, Inference of concise DTDs from XML data, in Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), 2006, pp. 115-126.
4. G. J. Bex, F. Neven, and J. Van den Bussche, DTDs versus XML schema: A practical study, in Proceedings of the 7th International Workshop on the Web and Databases (WebDB), 2004, pp. 79-84.
5. A. Brüggemann-Klein, M. Murata, and D. Wood, Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1, April 3, 2001, Technical report HKUSTTCSC-2001-0, The Hong Kong University of Science and Technology, Hong Kong, 2001.
6. A. Brüggemann-Klein and D.Wood, One-unambiguous regular languages, Inform. and Comput., 142 (1998), pp. 182-206 (Pubitemid 128451163)
7. A. Brüggemann-Klein, Unambiguity of extended regular expressions in SGML document grammars, in Proceedings of the First Annual European Symposium on Algorithms (ESA), Springer, London, 1993, pp. 73-84.
8. A. K. Chandra, D. Kozen, and L. J. Stockmeyer, Alternation, J. ACM, 28 (1981), pp. 114- 133.
9. J. Clark and M. Murata, RELAX NG Specification, OASIS, 2001.
10. J. Cristau, C. Löding, and W. Thomas, Deterministic automata on unranked trees, in Fundamentals of Computation Theory (FCT), Lecture Notes in Comput. Sci. 3623, M. Liskiewicz and R. Reischuk, eds., Springer, Berlin, 2005, pp. 68-79. (Pubitemid 41449439)
11. S. Dal-Zilio and D. Lugiez, XML schema, tree logic and sheaves automata, in Rewriting Techniques and Applications (RTA), Lecture Notes in Comput. Sci. 2706, R. Nieuwenhuis, ed., Springer, Berlin, 2003, pp. 246-263. (Pubitemid 36768725)
12. A. Deutsch, M. F. Fernandez, and D. Suciu, Storing semistructured data with STORED, in Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, 1999, pp. 431-442. (Pubitemid 129597355)
13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
14. W. Gelade, Succinctness of regular expressions with interleaving, intersection and counting, in Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Comput. Sci. 5162, Springer, Berlin, 2008, pp. 363-374.
15. L. Hemaspaandra and M. Ogihara, The Complexity Theory Companion, Springer, Berlin, 2002.
16. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 3rd ed., Addison-Wesley, Reading, MA, 2007.
17. H. Hosoya and B. C. Pierce, XDuce: A statically typed XML processing language, ACM Trans. Internet Technol., 3 (2003), pp. 117-148.
18. J. Jȩdrzejowicz and A. Szepietowski, Shuffle languages are in P, Theoret. Comput. Sci., 250 (2001), pp. 31-53. (Pubitemid 32674079)
19. P. Kilpeläinen and R. Tuhkanen, Regular expressions with numerical occurrence indicators-preliminary results, in Proceedings of the Eighth Symposium on Programming Languages and Software Tools (SPLST), 2003, pp. 163-173.
20. P. Kilpeläinen and R. Tuhkanen, Towards efficient implementation of XML schema content models, in Proceedings of the 2004 ACM Symposium on Document Engineering (DOCENG), ACM, New York, 2004, pp. 239-241. (Pubitemid 40788581)
21. P. Kilpeläinen and R. Tuhkanen, One-unambiguity of regular expressions with numeric occurrence indicators, Inform. and Comput., 205 (2007), pp. 890-916. (Pubitemid 46686994)
22. P. Kilpeläinen, Inclusion of Unambiguous #REs Is NP-Hard, unpublished note, University of Kuopio, Kuopio, Finland, 2004.
23. C. Koch, S. Scherzinger, N. Schweikardt, and B. Stegmaier, Schema-based scheduling of event processors and buffer minimization for queries on structured data streams, in Proceedings of the International Conference on Very Large Data Bases (VLDB), 2004, pp. 228-239.
24. D. Kozen, Lower bounds for natural proof systems, in Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1977, pp. 254-266.
25. M. Mani, Keeping chess alive-Do we need 1-unambiguous content models?, talk given at Extreme Markup Languages, Montreal, 2001.
26. I. Manolescu, D. Florescu, and D. Kossmann, Answering XML queries on heterogeneous data sources, in Proceedings of the International Conference on Very Large Data Bases (VLDB), 2001, pp. 241-250.
27. W. Martens, F. Neven, T. Schwentick, and G. J. Bex, Expressiveness and complexity of XML schema, ACM Trans. Database Syst., 31 (2006), pp. 770-813. (Pubitemid 44600826)
28. W. Martens, F. Neven, and T. Schwentick, Complexity of decision problems for simple regular expressions, in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS), J. Fiala, V. Koubek, and J. Kratochvíl, eds., Lecture Notes in Comput. Sci. 3153, Springer, Berlin, 2004, pp. 889-900.
29. W. Martens and F. Neven, Frontiers of tractability for typechecking simple XML transformations, J. Comput. System Sci., 73 (2007), pp. 362-390. (Pubitemid 46027077)
30. W. Martens and J. Niehren, On the minimization of XML schemas and tree automata for unranked trees, J. Comput. System Sci., 73 (2007), pp. 550-583. (Pubitemid 46440975)
31. A. J. Mayer and L. J. Stockmeyer, The complexity of word problems-this time with interleaving, Inform. and Comput., 115 (1994), pp. 293-311.
32. A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory, 1972, pp. 125-129.
33. M. Murata, D. Lee, M. Mani, and K. Kawaguchi, Taxonomy of XML schema languages using formal language theory, ACM Trans. Internet Technol., 5 (2005), pp. 1-45.
34. F. Neven and T. Schwentick, On the complexity of XPath containment in the presence of disjunction, DTDs, and variables, Log. Methods Comput. Sci., 2 (2006), 3:1.
35. Y. Papakonstantinou and V. Vianu, DTD inference for views of XML data, in Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), ACM Press, New York, 2000, pp. 35-46.
36. F. Reuter, An Enhanced W3C XML Schema-Based Language Binding for Object Oriented Programming Languages, manuscript, 2006.
37. H. Seidl, Deciding equivalence of finite tree automata, SIAM J. Comput., 19 (1990), pp. 424- 437. (Pubitemid 20696148)
38. H. Seidl, Haskell overloading is DEXPTIME-complete, Inform. Process. Lett., 52 (1994), pp. 57-60. (Pubitemid 124013221)
39. C. M. Sperberg-McQueen and H. Thompson, XML Schema, http://www.w3.org/ XML/ Schema (2005).
40. C. M. Sperberg-McQueen, XML Schema 1.0: A language for document grammars, in XML 2003, 2003; available online at http://www.idealliance.org/papers/ dxxml03/index.html.
41. L. J. Stockmeyer and A. R. Meyer, Word problems requiring exponential time: Preliminary report, in Proceedings of the 5th Annual ACM Symposium on Theory of Computing (STOC), 1973, pp. 1-9.
42. E. van der Vlist, XML Schema, O'Reilly, Sebastopol, CA, 2002.
43. P. van Emde Boas, The convenience of tilings, in Complexity, Logic, and Recursion Theory, Lect. Notes Pure Appl. Math. 187, Dekker, New York, 1997, pp. 331-363.
44. G. Wang, M. Liu, J. X. Yu, B. Sun, G. Yu, J. Lv, and H. Lu, Effective schema-based XML query optimization techniques, in Proceedings of the Seventh International Database Engineering and Applications Symposium (IDEAS), IEEE Computer Society, Los Alamitos, CA, 2003, pp. 230-235.