Abstract
TSQL2 is a declarative query language, and as such, requires a procedural (algebraic) equivalent for implementation. In this chapter, we describe such an algebraic language. We undertook this design in order to show that TSQL2 can be implemented efficiently, with minimal extension of existing techniques.
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.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Soo, M.D., Jensen, C.S., Snodgrass, R.T. (1995). An Algebra for TSQL2. In: Snodgrass, R.T. (eds) The TSQL2 Temporal Query Language. The Springer International Series in Engineering and Computer Science, vol 330. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2289-8_27
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2289-8_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5966-1
Online ISBN: 978-1-4615-2289-8
eBook Packages: Springer Book Archive