Efficient reasoning about a robust XML key fragment

ACM Transactions on Database Systems

Volumn 34, Issue 2, 2009, Pages

  Hartmann, Sven ^a,b   Link, Sebastian ^c  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b Department of Informatics ^*  (Germany)

^c VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Axiomatization; Implication; Reachability; XML data; XML key

Indexed keywords

ELECTRONIC DATA INTERCHANGE;

AXIOMATIZATION; IMPLICATION; REACHABILITY; XML DATA; XML KEY;

XML;

EID: 67651242794     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1538909.1538912     Document Type: Review

References (49)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. APPARAO, V. 1998. Document object model (DOM) level 1 specification, W3C recommendation. http://www.w3.org/TR/REC-DOM-Level-1/.
3. ARENAS, M. AND LIBKIN, L. 2004. A normal form for XML documents. Trans. Datab. Syst. 29, 1, 195-232.
4. ARENAS, M. AND LIBKIN, L. 2005. An information-theoretic approach to normal forms for relational and XML data. J. ACM 52, 2, 246-283.
5. BENEDIKT, M., FAN, W., AND KUPER, G. 2005. Structural properties of XPath fragments. Theor. Comput. Sci. 336, 1, 3-31.
6. BISKUP, J. AND POLLE, T. 2001. Decomposition of object-oriented database schemas. Ann. Math. Artif. Intell. 33, 2-4, 119-155.
7. BRAY, T., PAOLI, J., SPERBERG-MCQUEEN, C. M., MALER, E.,AND YERGEAU, F. 2006. Extensible markup language (XML) 1.0 (fourth edition) W3C recommendation. http://www.w3.org/TR/xml.
8. BUNEMAN, P., DAVIDSON, S., FAN, W., HARA, C., AND TAN, W. 2001a. Reasoning about keys for XML. In Proceedings of the 8th International Workshop on Database Programming Languages (DBPL). Lecture Notes in Computer Science, vol. 2397. Springer, 133-148.
9. BUNEMAN, P., DAVIDSON, S., FAN, W., HARA, C., AND TAN, W. 2002. Keys for XML. Comput. Netw. 39,5, 473-487.
10. BUNEMAN, P., DAVIDSON, S., FAN, W., HARA, C., AND TAN, W. 2003. Reasoning about keys for XML. Inform. Syst. 28, 8, 1037-1063.
11. BUNEMAN, P., FAN, W., SIMÉON, J., AND WEINSTEIN, S. 2001b. Constraints for semi-structured data and XML. SIGMOD Rec. 30, 1, 47-54.
12. BUNEMAN, P., FAN, W., AND WEINSTEIN, S. 2000. Path constraints in semistructured databases. J. Comput. Syst. Sci. 61, 2, 146-193.
13. CHOMICKI, J. 2007. Consistent query answering: Five easy pieces. In Proceedings of the 11th International Conference on Database Theory (ICDT). Lecture Notes in Computer Science, vol. 4353. Springer, 1-17.
14. CHOMICKI, J. AND NIWINSKI, D. 1995. On the feasibility of checking temporal integrity constraints. J. Comput. Syst. Sci. 51, 3, 523-535.
15. CLARK, J. AND DEROSE, S. 1999. XML path language (XPath) version 1.0, W3C recommendation. http://www.w3.org/TR/ xpath.
16. DAVIDSON, S., FAN, W., AND HARA, C. 2007. Propagating XML constraints to relations. J. Comput. Syst. Sci. 73, 3, 316-361.
17. DAVIDSON, S., FAN, W., AND HARA, C. 2008. Erratum to "Propagating XML constraints to relations". J. Comput. Syst. Sci. 74, 3, 404-405.
18. DEUTSCH, A. AND TANNEN, V. 2005. XML queries and constraints, containment and reformulation. Theor. Comput. Sci. 336, 1, 57-87.
19. FAGIN, R. AND VARDI, M. Y. 1984. The theory of data dependencies - An overview. In Proceedings of the 11th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 172. Springer, 1-22.
20. FAN, W. 2005. XML constraints. In Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA'05). IEEE Computer Society, 805-809.
21. FAN, W. AND LIBKIN, L. 2002. On XML integrity constraints in the presence of DTDs. J. ACM 49, 3, 368-406.
22. FAN, W. AND SIMÉON, J. 2003. Integrity constraints for XML. J. Comput. Syst. Sci. 66, 1, 254-291.
23. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2005. Efficient algorithms for processing XPath queries. Trans. Datab. Syst. 30, 2, 444-491.
24. HARA, C. AND DAVIDSON, S. 1999. Reasoning about nested functional dependencies. In Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System (PODS'99). ACM Press, 91-100.
25. HARTMANN, S. 2001. On the implication problem for cardinality constraints and functional dependencies. Ann. Math. Art. Intell. 33, 253-307.
26. HARTMANN, S., KOEHLER, H., LINK, S., TRINH, T., AND WANG, J. 2007. On the notion of an XML key. In Proceedings of the 3rd International Workshop on Semantics in Data and Knowledge Bases (SDKB). Lecture Notes in Computer Science, vol. 4925. Springer, 103-112.
27. HARTMANN, S. AND LINK, S. 2007a. Numerical constraints for XML. In Proceedings of the 14th International Workshop on Logic, Language, Information and Computation (WoLLIC). Lecture Notes in Computer Science, vol. 4576. Springer, 203-217.
28. HARTMANN, S. AND LINK, S. 2007b. Unlocking keys for XML trees. In Proceedings of the 11th International Conference on Database Theory (ICDT). Lecture Notes in Computer Science, vol. 4353. Springer, 104-118.
29. HARTMANN, S. AND LINK, S. 2008. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic 152, 1-3, 84-106.
30. HARTMANN, S. AND TRINH, T. 2006. Axiomatising functional dependencies for XML with frequencies. In Proceedings of the 4th International Symposium on Foundations of Information and Knowledge Systems (FoIKS'06). Lecture Notes in Computer Science, vol. 3861. Springer, 159-178.
31. ITO, M. AND WEDDELL, G. 1994. Implication problems for functional constraints on databases supporting complex objects. J. Comput. Syst. Sci. 49, 3, 726-768.
32. JENSEN, C., SNODGRASS, R., AND SOO, M. 1996. Extending existing dependency theory to temporal databases. Trans. Knowl. Data Engin. 8, 4, 563-582.
33. JUNGNICKEL, D. 1999. Graphs, Networks and Algorithms. Springer.
34. LENZERINI, M. AND NOBILI, P. 1990. On the satisfiability of dependency constraints in entity-relationship schemata. Inform. Syst. 15, 4, 453-461.
35. LIDDLE, S., EMBLEY, D., AND WOODFIELD, S. 1993. Cardinality constraints in semantic data models. Data Knowl. Eng. 11, 235-270.
36. MIKLAU, G. AND SUCIU, D. 2004. Containment and equivalence for a fragment of XPath. J. ACM 51, 1, 2-45.
37. NEVEN, F. AND SCHWENTICK, T. 2006. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods Comput. Sci. 2, 3:1.
38. PAREDAENS, J., DE BRA, P., GYSSENS, M., AND VAN GUCHT, D. 1989. The Structure of the Relational Database Model. Springer.
39. SUCIU, D. 2001. On database theory and XML. SIGMOD Rec. 30, 3, 39-45.
40. TARI, Z., STOKES, J., AND S PACCAPIETRA, S. 1997. Object normal forms and dependency constraints for object-oriented schemata. Trans. Datab. Syst. 22, 513-569.
41. THALHEIM, B. 1991. Dependencies in Relational Databases. Teubner.
42. THALHEIM, B. 2000. Entity-Relationship Modelling. Springer.
43. THOMPSON, H., BEECH, D., MALONEY, M., AND MENDELSOHN, N. 2004. XML schema part1: Structures 2nd Ed. W3C recommendation. http://www.w3.org/TR/xmlschema-1/.
44. VIANU, V. 2003. A Web odyssey: From Codd to XML. SIGMOD Rec. 32, 2, 68-77.
45. VINCENT, M., LIU, J., AND LIU, C. 2004. Strong functional dependencies and their application to normal forms in XML. Trans. Datab. Syst. 29, 3, 445-462.
46. VINCENT, M., LIU, J., AND MOHANIA, M. 2007. On the equivalence between FDs in XML and FDs in relations. Acta Inf. 44, 3-4, 207-247.
47. WEDDELL, G. 1992. Reasoning about functional dependencies generalized for semantic data models. Trans. Datab. Syst. 17, 1, 32-64.
48. WIDOM, J. 1999. Data management for XML: Research directions. Data Engin. Bull. 22, 3, 44-52.
49. WOOD, P. 2003. Containment for XPath fragments under DTD constraints. In Proceedings of the 9th International Conference on Database Theory (ICDT'03). Lecture Notes in Computer Science, vol. 2572. Springer, 297-311.