Naturally embedded query languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 646 LNCS, Issue , 1992, Pages 140-154

  Breazu Tannen, Val ^a   Buneman, Peter ^a   Wong, Limsoon ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; QUERY LANGUAGES; SEMANTICS;

CATEGORY THEORY; COMPLEX OBJECTS; EQUATIONAL THEORY; EXPRESSIVE POWER; IMPEDANCE MISMATCH; SEMANTIC FOUNDATION; STRUCTURAL RECURSION; SUBLANGUAGES;

QUERY PROCESSING;

EID: 84976697638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56039-4_38     Document Type: Conference Paper

References (23)

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 S. Abiteboul, P. C. Fisher, and H.-J. Schek, editors, LNCS 361: Nested Relations and Complex Objects in Databases, pages 117-138. Springer-Verlag, 1987.
2. Serge Abiteboul and Catriel Beeri. On the Power of Languages for the Manipulation of Complex Objects. In Proceedings of International Workshop on Theory and Applications o] Nested Relations and Complex Objects, Darmstadt, 1988.
3. Catriel Beeri and Yoran Kornatzky. Algebraic Optimisation of Object Oriented Query Languages. In S. Abiteboul and P. C. Kanellakis, editors, LNCS 470: 3rd International Conlerence on Database Theory, Paris, France, December 1990, pages 72-88, Berlin, December 1990. Springer-Verlag.
4. V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural Recursion as a Query Language. In Proceedings of 3rd International Workshop on Database Programming Languages, pages 9-19, Nahplion, Greece, August 1991. Morgan Kaufmann.
5. V. Breazu-Tannen, P. Buneman, and L. Wong. Naturally Embedded Query Languages. Technical Report MS-CIS-92-47/L&C 47, Department of Computer and Information Science, University of Pennsylvania, June 1992.
6. V. Breazu-Tannen and A. R. Meyer. Lambda calculus with constrained types (extended abstract). In R. Parikh, editor, Proceedings of the Conference on Logics of Programs, Brooklyn, June 1985, pages 23-40. Lecture Notes in Computer Science, Vol. 193, Springer-Verlag, 1985.
7. V. Breazu-Tannen and R. Subrahmanyam. Logical and Computational Aspects of Programming with Sets/Bags/Lists. In LNCS 510: Proceedings of 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991, pages 60-75. Springer Verlag, 1991.
8. O.P. Buneman, R. Nikhil, and R. E. Frankel. An Implementation Technique for Database Query Languages. ACM Transactions on Database Systems, 7(2):164-187, June 1982.
9. Ashok Chandra and David Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25:99-1289 1982.
10. Latha S. Colby. A Recursive Algebra for Nested Relations. Information Systems, 15(5):567-582, 1990.
11. Marc Gyssens and Dirk Van Gucht. A Comparison Between Algebraic Query Languages for Flat and Nested Databases. Theoretical Computer Science, 87:263-286, 1991.
12. Richard Hull and Jianwen Su. On the Expressive Power of Database Queries with Intermediate Types. Journal of Computer and System Sciences, 43:219-267, 1991.
13. Neil Immerman, Sushant Patnaik, and David Stemple. The Expressiveness of a Family of Finite Set Languages. In Proceedings of 10th ACM Symposium on Principles of Database Systems, pages 37-52, 1991.
14. J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
15. Eugenio Moggi. Notions of Computation and Monads. Information and Computation, 93:55-92, 1991.
16. A. Ohori, P. Buneman, and V. Breazu-Tannen. Database Programming in Machiavelli: A Polymorphic Language with Static Type Inference. In James Clifford, Bruce Lindsay, and David Maier, editors, Proceedings of ACM-SIGMOD International Conference on Management of Data, pages 46-57, Portland, Oregon~ June 1989.
17. Jan Paredaens and Dirk Van Gucht. Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions. In Proceedings of 7th ACM Symposium on Principles of Database Systems, Austin, Texas, pages 29-38, 1988.
18. H.-J. Schek and M. H. Scholl. The Relational Model with Relation-Valued Attributes. Information Systems, 11(2):137-147, 1986.
19. S. J. Thomas and P. C. Fischer. Nested Relational Structures. In P. C. Kanellakis, editor, Advances in Computing Research: The Theory of Databases, pages 269-307. JAI Press, 1986.
20. P. W. Trinder. Comprehension: A Query Notation for DBPLs. In Proceedings of 3rd International Workshop on Database Programming Languages, pages 49-62, Nahplion, Greece, August 1991. Morgan Kaufmann.
21. P. W. Trinder and P. L. Wadler. List Comprehensions and the Relational Calculus. In Proceedings of 1988 Glasgow Workshop on Functional Programming, pages 115-123, Rothesay, Scotland, August 1988.
22. Philip Wadler. Comprehending Monads. In Proceedings of ACM Conference on Lisp and Functional Programming, Nice, June 1990.
23. David A. Watt and Phil Trinder. Towards a Theory of Bulk Types. Fide Technical Report 91/26, Glasgow University, Glasgow G12 8QQ, Scotland, July 1991