Abstract
Many different DMLs can be designed to express database manipulations. Different DMLs will probably differ in syntax, but more importantly they can differ in the basic operations provided. For those familiar with programming, these differences are not unlike that found in different programming languages. There, the basic constructs provided can greatly differ in syntax and in their underlying approach to specifying computations. The latter can be very contrasting indeed — look at, for example, the differences between procedural (eg. C) and declarative (eg. Prolog) approaches to specifying computations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Maurer, H., Scherbakov, N., Halim, Z., Razak, Z. (1998). Relational Algebra I. In: From Databases to Hypermedia. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58763-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-58763-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63754-7
Online ISBN: 978-3-642-58763-4
eBook Packages: Springer Book Archive