On the complexity of verifying consistency of XML specifications

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 841-880

  Arenas, Marcelo ^a   Fan, Wenfei ^b   Libkin, Leonid ^b  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Complexity; Consistency; Document type definition; Keys and foreign keys; XML

Indexed keywords

COMPUTABILITY AND DECIDABILITY; KEYS (FOR LOCKS); MARKUP LANGUAGES; NUCLEAR PROPULSION; SPECIFICATIONS;

COMPILE TIMES; COMPLEXITY; COMPLEXITY BOUNDS; CONSISTENCY; CONSISTENCY PROBLEMS; DOCUMENT TYPE DEFINITION; DOCUMENT TYPE DEFINITIONS; FOREIGN KEYS; INTEGRITY CONSTRAINTS; KEYS AND FOREIGN KEYS; REGULAR EXPRESSIONS; XML DATUMS; XML SPECIFICATIONS;

XML;

EID: 55249114900     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050646895     Document Type: Article

References (40)

1. S. ABITEBOUL AND V. VIANU, Regular path queries with constraints, J. Comput. System Sci., 58 (1999), pp. 428-452.
2. C. K. BARU, A. GUPTA, B. LUDÄSCHER, R. MARCIANO, Y. PAPAKONSTANTINOU, P. VELIKHOV, AND V. CHU, XML-based information mediation with MIX, in Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data. Philadelphia, PA, 1999, pp. 597-599.
3. C. BEERI AND T. MILO, Schemas for integration and translation of structured and semi-structured data, in Proceedings of the 7th International Conference on Database Theory, Lecture Notes in Comput. Sci. 1540, Springer, New York, 1999, pp, 296-313.
4. M. BENEDIKT, C. Y. CHAN, W. FAN, J. FREIRE, AND R. RASTOGI, Capturing both types and constraints in data integration, in Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA, 2003, pp, 277-288.
5. P. BUNEMAN, S. B. DAVIDSON, W. FAN, C. S. HARA, AND W. C. TAN, Keys for XML, Comput. Networks, 39 (2002), pp. 473-487.
6. P. BUNEMAN, W. FAN, AND S. WEINSTEIN, Path constraints in semistructured databases, J. Comput. System Sci., 61 (2000), pp. 146-193.
7. D. CALVANESE, G. DE GIACOMO, AND M. LENZERINI, Representing and reasoning on XML documents: A description logic approach, J. Logic Comput., 9 (1999), pp. 295-318.
8. D. CALVANESE AND M. LENZERINI, Making object-oriented schemas more expressive, in Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Minneapolis, MN, 1994, pp. 243-254.
9. D. CALVANESE AND M. LENZERINI, On the interaction between ISA and cardinality constraints, in Proceedings of the 10th International Conference on Data Engineering, IEEE, Piscataway, NJ, 1994, pp. 204-213.
10. M. J. CAREY, D. FLORESCU, Z. G. IVES, Y. LU, J. SHANMUGASUNDARAM, E. J. SHEKITA, AND S. N. SUBRAMANIAN, XPERANTO: Publishing object-relational data as XML, in International Workshop on the Web and Databases (Informal Proceedings), Lecture Notes in Comput. Sci. 1997, Springer, New York, 2000, pp. 105-110.
11. S. S. COSMADAKIS, P. C. KANELLAKIS, AND M. Y. VARDI, Polynomial-time implication problems for unary inclusion dependencies, J. ACM, 37 (1990), pp. 15-46.
12. S. B. DAVIDSON, W. FAN, AND C. S. HARA, Propagating XML constraints to relations, J. Comput. System Sci., 73 (2007), pp. 316-361.
13. A. DEUTSCH, L. POPA, AND V. TANNEN, Physical data independence, constraints, and optimization with universal plans, in Proceedings of the 25th International Conference on Very Large Data Bases, Morgan Kaufmann, San Francisco, 1999, pp. 459-470.
14. A. DEUTSCH AND V. TANNEN, Reformulation of XML queries and constraints, in Proceedings of the 9th International Conference on Database Theory, Lecture Notes in Comput. Sci. 2572, Springer, New York, 2003, pp. 225-241.
15. A. EYAL AND T. MILO, Integrating and customizing heterogeneous e-commerce applications, The VLDB Journal, 10 (2001), pp. 16-38.
16. W. FAN AND L. LIBKIN, On XML integrity constraints in the presence of DTDs, J. ACM, 49 (2002), pp. 368-406.
17. M. F. FERNANDEZ, D. FLORESCU, A. Y. LEVY, AND D. SUCIU, Verifying integrity constraints on web sites, in Proceedings of the 16th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Francisco, 1999, pp. 614-619.
18. M. F. FERNANDEZ, A. MORISHIMA, D. SUCIU, AND W. C. TAN, Publishing relational data in XML: The SilkRoute approach, IEEE Data Engineering Bulletin, 24 (2001), pp. 12-19.
19. D. FLORESCU AND D. KOSSMANN, Storing and querying XML data using an RDMBS, IEEE Data Engineering Bulletin, 22 (1999), pp. 27-34.
20. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP- Completeness, W. H. Freeman, San Francisco, 1979.
21. R. GIVAN, D. A. MCALLESTER, C. WITTY, AND D. KOZEN, Tarskian set constraints, Inform. and Comput., 174 (2002), pp. 105-131.
22. P. C. KANELLAKIS, On the computational complexity of cardinality constraints in relational databases, Inform. Process. Lett., 11 (1980), pp. 98-101.
23. D. LEE AND W. W. CHU, Constraints- preserving transformation from XML document type definition to relational schema, in Proceedings of the 19th International Conference on Conceptual Modeling, Lecture Notes in Comput. Sci. 1920, Springer, New York, 2000, pp. 323-338.
24. Y. MATIYASEVICH, Hilbert's 10th Problem, MIT Press, Cambridge, MA, 1993.
25. F. NEVEN, Extensions of attribute grammars for structured document queries, in Proceedings of the 7th International Workshop on Database Programming Languages, Lecture Notes in Comput. Sci. 1949, Springer, New York, 1999, pp. 99-116.
26. F. NEVEN AND T. SCHWENTICK, Query automata over finite trees, Theoret. Comput. Sci., 275 (2002), pp. 633-674.
27. C. PAPADIMITRIOU, On the complexity of integer programming, J. ACM, 28 (1981), pp. 765-768.
28. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
29. Y. PAPAKONSTANTINOU AND V. VIANU, DTP inference for views of XML data, in Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 35-46.
30. J. SHANMUGASUNDARAM, E. J. SHEKITA, R. BARR, M. J. CAREY, B. G. LINDSAY, H. PIRAHESH, AND B. REINWALD, Efficiently publishing relational data as XML documents, The VLDB Journal, 10 (2001), pp. 133-154.
31. J. SHANMUGASUNDARAM, K. TUFTE, C. ZHANG, G. HE, D. DEWITT, AND J. NAUGHTON, Relational databases for querying XML documents: Limitations and opportunities, in Proceedings of the 25th International Conference on Very Large Data Bases, Morgan Kaufmann, San Francisco, 1999, pp. 302-314.
32. J. W. THATCHER, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. System Sci., 1 (1967), pp. 317-322.
33. J. ULLMAN, Principles of Database and Knowledge-Base Systems, Volume I, Computer Science Press, Rockville, MD, 1988.
34. W3C, Document Object Model (DOM) Level 1 Specification, W3C Recommendation, October 1998, http://www.w3.org/TR/REC-DOM-Level-1/.
35. W3C, Extensible Markup Language (XML) 1.0 (third edition), W3C Recommendation, February 2004, http://www.w3.org/TR/2004/REC-xml-20040204/.
36. W3C, XML-Data, W3C Note, January 1998, http://www.w3.org/TR/1998/ NOTE-XML-data-0105/.
37. W3C, XML Path Language (XPath) Version 1.0, W3C Recommendation, November 1999, http://www. w3.org/TR/xpath.
38. W3C, XML Schema, W3C Recommendation, October 2004, http://www.w3.org/ XML/Schema.
39. W3C, XQuery 1.0 : An XML Query Language, W3C Working Draft 29, October 2004, http://www.w3.org/TR/2004/WD-xquery-20041029/.
40. W3C, XSL Transformations (XSLT) Version 1.0, W3C recommendation, November 1999, http://www.w3.org/TR/xslt.