A normal form for XML documents

ACM Transactions on Database Systems

Volumn 29, Issue 1 SPEC. ISS., 2004, Pages 195-232

  Arenas, Marcelo ^a   Libkin, Leonid ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Design; DTDs; Functional dependencies; Normal form; XML data

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONTEXT FREE GRAMMARS; DATABASE SYSTEMS; GRAPH THEORY; PROGRAM DOCUMENTATION; WORLD WIDE WEB;

DTDS; FUNCTIONAL DEPENDENCIES; NORMAL FORMS; XML DATA;

XML;

EID: 3042647135     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/974750.974757     Document Type: Conference Paper

References (35)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass.
2. ABITEBOUL, S., SEGOUFIN, L., AND VIANU, V. 2001. Representing and querying XML with incomplete information. In Proceedings of the 20th ACM Symposium on Principles of Database Systems. ACM, New York, 150-161.
3. ALBERT, J., GIAMMARRESI, D., AND WOOD, D. 2001. Normal form algorithms for extended context-free grammars. Theoret. Comput. Sci. 267, 1-2, 35-47.
4. ARENAS, M. AND LIBKIN, L. 2003. An information-theoretic approach to normal forms for relational and XML data. In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 15-26.
5. ATZENI, P. AND MOHFUNI, N. 1984. Functional dependencies in relations with null values. Inf. Porc. Lett. 18, 4, 233-238.
6. BEERI, C., BERNSTEIN, P., AND GOODMAN, N. 1978. A sophisticated introduction to database normalization theory. In Proceedings of the 4th International Conference on Very Large Data Bases. 113-124.
7. BUNEMAN, P., DAVIDSON, S., FAN, W., HARA, C., AND TAN, W. C. 2001a. Keys for XML. In Proceedings of the 10th International World Wide Web Conference. 201-210.
8. BUNEMAN, P., DAVIDSON, S., FAN, W., HARA, C., AND TAN, W. C. 2001b. Reasoning about keys for XML. In Proceedings of the 8th International Workshop on Database Programming Languages.
9. BUNEMAN, P., JUNG, A., AND OHORI, A. 1991. Using powerdomains to generalize relational databases. Theoret. Comput. Sci. 91, 1, 23-55.
10. BOWLING, W. AND GALLIER, J. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1, 3, 267-284.
11. EBXML. 2001. Business Process Specification Schema v1.01. http ://www. ebxml.org/specs/.
12. EMBLEY, D. AND MOK, W. Y. 2001. Developing XML documents with guaranteed "good" properties. In Proceedings of the 20th International Conference on Conceptual Modeling. 426-441.
13. FAN, W. AND LIBKIN, L. 2001. On XML integrity constraints in the presence of DTDs. In Proceedings of the 20th ACM Symposium on Principles of Database Systems. ACM, New York, 114-125.
14. FAN, W. AND SIMÉON, J. 2000. Integrity constraints for XML. In Proceedings of the 19th ACM Symposium on Principles of Database Systems. ACM, New York, 23-34.
15. FLORESCU, D. AND KOSSMANN, D. 1999. Storing and querying XML data using an RDMBS. IEEE Data Eng. Bull. 22, 3, 27-34.
16. GHAHNE, G. 1991. The Problem of Incomplete Information in Relational Databases. Springer-Verlag, New York, Cambridge, Mass.
17. GUNTER, C. 1992. Semantics of Programming Languages: Structures and Techniques. MIT Press, Cambridge, Mass.
18. HIGGINS, J. AND JELLIFFE, R. 1999. QAML Version2.4.http://xml.ascc.net/ resourca/qaml-xml.dtd.
19. HULL, R. 1986. Relative information capacity of simple relational database schemata. SIAM J. Comput. 15, 3, 856-886.
20. IMIELINSKI, T. AND LIPSKI, W., JR. 1984. Incomplete information in relational databases. J. ACM 31, 4, 761-791.
21. KANELLAKIS, P. 1990. Elements of relational database theory. In Handbook of Theoretical Computer Science, Volume B, pages 1075-1144, MIT Press, Cambridge, Mass.
22. KANNE, C.-C. AND MOERKOTTE, G. 2000. Efficient storage of XML data. In Proceedings of the 16th International Conference on Data Engineering. 198.
23. LEE, M.-L., LING, T. W., AND Low, W. L. 2002. Designing functional dependencies for XML. In Proceedings of the 8th International Conference on Extending Database Technology. 124-141.
24. LEVENE, M. AND LOIZOU, G. 1998. Axiomatisation of functional dependencies in incomplete relations. Theoret. Comput. Sci. 206, 1-2, 283-300.
25. LEY, M. 2003. DBLP. http://www.informatik.uni-trier.de/~ley/db/index. html.
26. MOK, W. Y., NG, Y.-K., AND EMBLEY, D. 1996. A normal form for precisely characterizing redundancy in nested relations. ACM Trans. Datab. Syst. 21, 1, 77-106.
27. ÖZSOYOGLU, M. AND YUAN, L.-Y. 1987. A new normal form for nested relations. ACM Trans. Datab. Syst. 12, 1, 111-136.
28. SAGIV, Y., DELOBEL, C., PARKER, D. S., AND FAGIN, R. 1981. An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28, 3, 435-453.
29. SHANMUGASUNDARAM, J., TUFTE, K., ZHANG, C., HE, G., DEWITT, D., AND NAUGHTON, J. 1999. Relational databases for querying XML documents: limitations and opportunities. In Proceedings of 25th International Conference on Very Large Data Bases. 302-314.
30. SUCIU, D. 1997. Bounded fixpoints for complex objects. Theoret. Comput. Sci. 176, 1-2, 283-328.
31. TARI, Z., STOKES, J., AND SPACCAPIETRA, S. 1997. Object normal forms and dependency constraints for object-oriented schemata. ACM Transaction on Database Systems 22, 4, 513-569.
32. TATARINOV, I., IVES, Z., HALEVY, A., AND WELD, D. 2001. Updating XML. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data. ACM, New York, 413-424.
33. VAN DEN BUSSCHE, J. 2001. Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions. Theoret. Comput. Sci. 254, 1-2, 363-377.
34. W3C. 1998 XML-Data, W3C Note.http://www.microsoft.com/standards/xml/ xmldata-f.htm.
35. W3C. 2001 Xml schema, W3C Working Draft. http://www.w3.org/XML/Schema.