Normal forms and conservative extension properties for query languages over collection types

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 495-505

  Wong, Limsoon ^a  

^a Real World Comp Partnership N   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FUNCTIONS; OPTIMIZATION; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

CONSERVATIVE EXTENSION PROPERTY; EQUATIONAL THEORY; NESTED RELATIONAL QUERY LANGUAGE; QUERY OPTIMIZATION; RELATIVE SET ABSTRACTION; SEMANTICS;

QUERY LANGUAGES;

EID: 0030171941     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0037     Document Type: Article

References (36)

1. S. Abiteboul, C. Beeri, M. Gyssens, and D. Van Gucht, An introduction to the completeness of languages for complex objects and nested relations, in "Nested Relations and Complex Objects in Databases," Lecture Notes in Computer Science, Vol. 361, Springer-Verlag, Berlin, 1989.
2. S. Abiteboul, and C. Beeri, On the power of languages for the manipulation of complex objects, in "Proceedings of International Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988."
3. S. Abiteboul and R. Hull, IFO: A formal semantic database model, ACM Trans. Database Systems 12, No. 4 (1987), 525-565.
4. H. Barendregt, "The Lambda Calculus: Its Syntax and Semantics," Studies in Logic and Foundations of Mathematics, Vol. 103, Elsevier, New York/Amsterdam, 1984.
5. V. Breazu-Tannen, P. Buneman and S. Naqvi, Structural recursion as a query language, in "Proceedings of 3rd International Workshop on Database Programming Languages," Kaufmann, Los Altos, CA, 1991.
6. V. Breazu-Tannen and R. Subrahmanyam, Logical and computational aspects of programming with Sets/Bags/Lists, in "Proceedings of 18th International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 510, Springer-Verlag, Berlin, 1991.
7. V. Breazu-Tannen, P. Buneman, and L. Wong, Naturally embedded query languages, in "Proceedings of 4th International Conference on Database Theory," Lecture Notes in Computer Science, Vol. 646, Springer-Verlag, Berlin, 1992.
8. H. B. Enderton, "Mathematical Introduction to Logic," Academic Press, San Diego, 1972.
9. H. Gaifman, On local and non-local properties, in "Proceedings of the Herbrand Symposium, Logic Colloquium '81," North-Holland, Amsterdam, 1982.
10. S. Grumbach and V. Vianu, Playing games with objects, in "Proceedings of 3rd International Conference on Database Theory," Lecture Notes in Computer Science, Vol. 470, Springer-Verlag, Berlin, 1990.
11. C. A. Gunter, "Semantics of Programming Languages: Structures and Techniques," Foundations of Computing, MIT Press, Cambridge, 1992.
12. M. Gyssens and D. Van Gucht, A comparison between algebraic query languages for flat and nested databases, Theoret. Comput. Sci. 87 (1991), 263-286.
13. R. Hull, and J. Su, On the expressive power of database queries with intermediate types, J. Comput. System Sci. 43 (1991), 219-267.
14. R. Hull, and C. K. Yap, The format model: A theory of database organization, J. Assoc. Comput. Mach. 31, No. 3 (1984), 518-537.
15. G. Jaeschke, and H. J. Schek, Remarks on the algebra of non-first-normal-form relations, in "Proceedings 1st ACM SIGACT/SIGMOD Symposium on Principles of Database systems, Los Angeles, CA, 1982."
16. L. A. Jategaonkar, and J. C. Mitchell, ML with extended pattern matching and subtypes, in "Proceedings of ACM Conference on LISP and Functional Programming, Snowbird, UT, 1988."
17. L. Libkin, and L. Wong, Aggregate functions, conservative extension, and linear orders, in "Proceeding of 4th International Workshop on Database Programming Languages, Manhattan, NY, 1993."
18. L. Libkin, and L. Wong, Some properties of query languages for bags, in "Proceedings of 4th International Workshop on Database Programming Languages Manhattan, NY, 1993."
19. L. Libkin, and L. Wong, Conservativity of nested relational calculi with internal generic functions, Inform. Process. Lett. 49, No. 6 (1994), 273-280.
20. L. Libkin, and L. Wong, New techniques for studying set languages, bag languages, and aggregate functions, in "Proceedings of 13th ACM Symposium on Principles of Database Systems, Minneapolis, MN, 1994."
21. R. Milner, M. Tofte, and R. Harper, "The Definition of Standard ML," MIT Press, Cambridge, MA, 1990.
22. E. Moggi, Notions of computation and monads, Inform, and Comput. 93 (1991), 55-92.
23. A. Ohori, P. Buneman, V. Breazu-Tannen, Database programming in Machiavelli: A polymorphic language with static type inference, in "Proceedings of ACM-SIGMOD International Conference on Management of Data, Portland, OR, 1989."
24. A. Ohori, "A Study of Semantics, Types, And Languages For Databases And Object Oriented Programming," Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 1989.
25. J. Paredaens, and D. Van Gucht, Converting nested relational algebra expressions into flat algebra expressions, ACM Trans. Database Systems 17, No. 1 (1992), 65-93.
26. D. Remy, Typechecking records and variants in a natural extension of ML, in "Proceedings of 16th Symposium on Principles of Programming Languages, Austin, TX, 1989."
27. S. J. Thomas, and P. C. Fischer, Nested relational structures, in "Advances in Computing Research: The Theory of Databases," JAI Press, 1986.
28. P. W. Trinder, Comprehension: A query notation for DBPLs, in "Proceedings of 3rd International Workshop on Database Programaming Languages," Kaufmann, Los Altos, 1991.
29. P. W. Trinder, and P. L. Wadler, List comprehensions and the relational calculus, in "Proceedings of 1988 Glasgow Workshop on Functional Programming," Rothesay, Scotland, 1988.
30. D. Turner, Recursion equations as a programming language, in "Functional Programming and Its Applications," Cambridge Univ. Press, Cambridge, MA, 1982.
31. D. Turner, Miranda - A non-strict functional language with polymorphic types, in "Proceedings of Conference on Functional Programming Languages and Computer Architecture," Lecture Notes in Computer Science, Vol. 201, Springer-Verlag, Berlin, 1985.
32. P. Wadler, Listlessness is better than laziness, in "Proceedings of ACM Symposium on Lisp and Functional Programming, Austin, TX, 1984."
33. P. Wadler, Listlessness is better than laziness, II, in "Programs as Data Objects," Lecture Notes in Computer Science, Vol. 217, Springer-Verlag, Berlin, 1985.
34. P. Wadler, Comprehending monads, Math, structures in Comput. Sci. 2 (1992), 461-493.
35. D. A. Watt, and P. Trinder, "Towards a Theory of Bulk Types," Fide Tech. Rep. 91/26, Glasgow University, Glasgow, Scotland, 1991.
36. L. Wong, "Querying Nested Collections," Ph.D. thesis, Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA, 1994.