Abstract
Query languages have been a major research topic in the database area. Many results about the complexity and expressiveness of such languages have been obtained, both for the relational model and for various extensions. However, these results do not seem to provide sufficient guidelines for practical query language development. With the desire to generalize from relational to general bulk types, the need for such design guidelines is felt. The paper surveys a recently proposed theory of query languages, based on basic notions from category theory, specifically on variants of monads, and argues that it provides a good framework for practical language design.
Work supported by a grant from GIF — The German Israeli Foundation for Scientific Research and Development.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and C. Beeri. On the power of query languages for complex objects. The VLDB Journal, 1994. to appear.
S. Abiteboul, R. Hull, and V. Vianu. Database Theory From A to F. Addison-Wesley, 1994. to appear.
M. Atkinson, P. Richard, and P. Trinder. Bulk types for large scale programming. In Proc. 1st Int'l East-West Database Workshop on Next Generation Information System Technology, Kiev, USSR, Oct. 9–12, 1990, volume 504 of LNCS, pages 229–250. Springer-Verlag, 1991.
V. Breazau-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query language. In P. Kanellakis and J. Schmidt, editors, Proc. 3rd Int'l Workshop on Database Programming Languages, Nafplion, Greece, Aug. 27–30, 1991, pages 9–19. Morgan Kaufmann Publishers, 1992.
V. Breazu-Tannen, P. Buneman, and L. Wong. Naturally embedded query languages. In Proc. 4'th Int'l Conference on Database Theory, Berlin, Germany, volume 646 of LNCS, pages 140–154. Springer-Verlag, Oct. 1992.
P. Buneman. The fast fourier transform as a database query. Unpublished, 1993.
E. F. Codd. Relational completeness of database sublanguages. In R. Rustin, editor, Data Base Systems, pages 65–98. Prentice-Hall, 1972.
S. Grumbach and V. Vianu. Tractable query languages for complex object databases. In Proc. 10th A CM SIGA CT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Denver, Colorado, 1991.
R. Hull and J. Su. On the expressive power of database queries with intermediate types. Journal of Computer and System Science, 43:219–267, 1991.
L. Libkin and L. Wong. Semantic properties and query languages for or-sets. In Proc. 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Washington, D.C., pages 37–48, May 1993.
L. Libkin and L. Wong. Aggregate functions, conservative extension, and linear orders. In Proc. 4'th Int'l Workshop on Database Programming Languages, New York City, pages 282–294. Springer-Verlag, 1994.
L. Libkin and L. Wong. Some properties of query languages for bags. In Proc. 4'th Int'l Workshop on Database Programming Languages, New York City, pages 97–114. Springer-Verlag, 1994.
A. Makinouchi. A consideration of normal form of not-necessarily-normalized relations in the relational data model. In Proc. 3rd Int'l Conference on Very Large Databases, Tokyo, Japan, pages 447–453, Oct. 1977.
G. Malcolm. Homomorphisms and promotability. In Mathematics of Program Construction, volume 375 of LNCS, pages 335–347. Springer-Verlag, 1989.
F. Manola and U. Dayal. PDM: An object-oriented data model. In Int'l Workshop on Object-Oriented Database Systems, pages 18–25. IEEE, 1986.
F. Matthes and J. Schmidt. Bulk types: Built-in or add-on? In Proc. 3rd Int'l Workshop on Database Programming Languages, Nafplion, Greece, Aug. 27–30, 1991, pages 33–54. Morgan Kaufmann Publishers, 1992.
E. Moggi. Notions of computation and monads. Information and Computation, 93:55–92, 1991.
D. Suciu. Bounded fixpoints for complex objects. In Proc. 4'th Int'l Workshop on Database Programming Languages, New York City, pages 263–281. Springer-Verlag, 1994.
D. Suciu and J. Paredaens. Any algorithm in the complex object algebra with powwerset needs exponential space to compute transitive closure. In Proc. 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Minneapolis, MN, pages 201–209, May 1994.
V. Tannen. Tutorial: Languages for collection types. In Proc. 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Minneapolis, MN, pages 150–154, May 1994.
P. Trinder. Comprehensions, a query notation for DBPLs. In P. Kanellakis and J. Schmidt, editors, Proc. 3rd Int'l Workshop on Database Programming Languages, Nafplion, Greece, Aug. 37–30, 1991, pages 55–68. Morgan Kaufmann Publishers, 1992.
P. Trinder and P. Wadler. List comprehensions and the relational calculus. In Proc. 1988 Glasgow Workshop on Functional Programming, Rothesay, Scotland, pages 115–123, Aug. 1988.
P. Trinder and P. Wadler. Improving list comprehension database queries. In Proc. 4th IEEE Int'l Conference — Information Technologies for the 90's (TENCOM'89), Bombay, India, pages 186–192, Nov. 1989.
P. Wadler. List comprehensions. In S. L. P. Jones, editor, The Implementation of Functional Programming Languages (Chapt. 7), pages 127–138. Prentice Hall, 1987.
P. Wadler. Comprehending monads. Mathematical Structures in Computer Science, (2):461–493, 1992.
D. Watt and P. Trinder. Towards a theory of bulk types. Fide Technical Report 91/26, Department of Computing Science, University of Glasgow, July 1991.
L. Wong. Normal forms and conservative properties for query languages over collection types. In Proc. 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Washington, D.C., pages 26–36, May 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beeri, C. (1995). Bulk types and query language design. In: Astesiano, E., Reggio, G., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1994 1994. Lecture Notes in Computer Science, vol 906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014421
Download citation
DOI: https://doi.org/10.1007/BFb0014421
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59132-0
Online ISBN: 978-3-540-49198-9
eBook Packages: Springer Book Archive