Skip to main content
SpringerLink
Log in
Book cover

Database Programming Languages (DBPL-4) pp 80–96Cite as

Bulk Data Types, A Theoretical Approach

  • Conference paper

  • 51 Accesses

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

The treatment of bulk data types (BDTs) is a fundamental issue in database programming languages. A uniform, formal, treatment of BDTs is still lacking. We present a formal definition of bulk data types, based on parameterized algebraic specifications. We then define appropriate relationships between bulk types, and show that BDTs together with such relationships form a category with sets as the terminal object. We consider how to apply structural recursion (using a function called pump) to all bulk types, and show how equationally constrained BDTs imply similar constraints on the arguments to pump.

Based on P. Ta-Shma’s M.Sc. thesis. Work partially supported by a grant from GIF — the German Israeli Foundation for Scientific Research and Development

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Atkinson, P. Richard, P. Trinder. Bulk Types for Large Scale Programming, Proceedings of the Kiev East/West Workshop on Next Generation Database Technology, LNCS Volume 504, April 1991.

    Google Scholar 

  2. F. Bancilhon, T. Briggs, S. Khoshafian, P. Valduriez. FAD, A Powerful and Simple Database Language, Proceedings of the Thirteenth International Conference on Very Large Data Bases, Brighton, 1987.

    Google Scholar 

  3. F. Bancilhon, S. Cluet, C. Delobel A Query Language for the 02 Object-Oriented Database System, Proceedings of the Second International Workshop on Database Programming Languages, Oregon, June 1989.

    Google Scholar 

  4. M. Barr, C. Wells. Category Theory for Computing Science. Prentice Hall International Series in Computer Science, UK, 1990.

    MATH  Google Scholar 

  5. C. Beeri, Y. Kornatzky. Algebraic Optimization of Object-Oriented Query Languages, Proceedings of the Third International Conference on Database Theory, LNCS 470, France, 1990.

    Google Scholar 

  6. C. Beeri, T. Milo. Subtyping in OODB’s. Tenth Symposium on Principles of Database Systems, Denver, Colorado, May 1991.

    Google Scholar 

  7. V. Breazu-Tannen, P. Buneman, S. Naqvi. Structural Recursion as a Query Language, Proceedings of the Third International Workshop on Database Programming Languages, 1991.

    Google Scholar 

  8. V. Breazu-Tannen, R. Subrahmanyam. Logical and Computational Aspects of Programming with Sets/Bags/Lists, International Colloquium on Automata, Languages and Programming, LNCS 510, 1991.

    Google Scholar 

  9. H. Ehrig, B. Mahr. Fundamentals of Algebraic Specifications I, Equations and Initial Semantics, EATCS Monographs on Theoretical Computer Science 6, Springer-Verlag, Berlin, 1985.

    Google Scholar 

  10. J. Goguen, J. Thatcher, E. Wagner. An Initial Algebra Approach to The Specification, Correctness and Implementation of Abstract Data Types. Current Trends in Programming Methodology volume 4. Raymond T. Yeh (ed) 1978, pp 80–150.

    Google Scholar 

  11. R. Hull, J. Su. On Bulk Data Type Constructors and Manipulation Primitives: A Framework for Analyzing Expressive Power and Complexity Proceedings of the Second Workshop on Database Programming Languages, 1989.

    Google Scholar 

  12. F. Matthes, J. Schmidt. Bulk Types: Built-In or Add-On ? Proceedings of the Third International Workshop on Database Programming Languages 1991.

    Google Scholar 

  13. A. Ohori, P. Buneman, V. Breazu-Tannen. Database Programming in Machiavelli - a Polymorphic Language with Static Type Inference, Proceedings of the ACM SIGMOD International Conference on Management of Data, Portland, Oregon, June 1989.

    Google Scholar 

  14. P. Ross (now P. Ta-Shma). Bulk Data Types - A Theoretical Approach, Masters Thesis, The Hebrew University of Jerusalem, September 1992.

    Google Scholar 

  15. P. Trinder. Comprehensions, a Query Notation for DBPLs Proceedings of the Third International Workshop on Database Programming Languages1991

    Google Scholar 

  16. P. Wadler. Comprehending Monads. ACM Conference on Lisp and Functional Programming, Nice, June 1990.

    Google Scholar 

  17. P. Wadler. List Comprehensions, in S. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, 1987.

    Google Scholar 

  18. P. Wadler. Views: A way for pattern matching to cohabit with data abstraction. Proceedings of Principles of Programming Languages 1987

    Google Scholar 

  19. D. Watt, P. Trinder. Towards a Theory of Bulk Types. FIDE Technical Report FIDE/91/26.

    Google Scholar 

  20. M. Wirsig. Algebraic Specification in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam 1990 pp 675–788.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, The Hebrew University of Jerusalem, Israel

    Catriel Beeri & Paula Ta-Shma

Authors
  1. Catriel Beeri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paula Ta-Shma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, The Hebrew University of Jerusalem, 91904, Givat-Ram, Jerusalem, Israel

    Catriel Beeri PhD

  2. Research Institute for Mathematical Sciences, Kyoto University, Kitashirakawa, Sakyo-ku, 606-01, Kyoto, Japan

    Atsushi Ohori PhD

  3. Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012-1185, New York, NY, USA

    Dennis E. Shasha PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beeri, C., Ta-Shma, P. (1994). Bulk Data Types, A Theoretical Approach. In: Beeri, C., Ohori, A., Shasha, D.E. (eds) Database Programming Languages (DBPL-4). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3564-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3564-7_6

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19853-6

  • Online ISBN: 978-1-4471-3564-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation