Transcription of Relational Algebra and SQL - Cornell University
{{id}} {{{paragraph}}}
Database Management Systems, R. Ramakrishnan and J. Gehrke1 Relational Algebra and SQLJ ohannes fromDatabase Management Systems, 3rdEdition,Ramakrishnan and Management Systems, R. Ramakrishnan and J. Gehrke2 Relational Query LanguagesvQuery languages: Allow manipulation and retrieval of data from a model supports simple, powerful QLs: Strong formal foundation based on logic. Allows for much Languages !=programming languages! QLs not expected to be Turing complete . QLs not intended to be used for complex calculations. QLs support easy, efficient access to large data Management Systems, R. Ramakrishnan and J. Gehrke3 Formal Relational Query LanguagesvTwo mathematical Query Languages form the basis for real languages ( SQL), and for implementation: Relational Algebra : More operational, very useful for representing execution plans. Relational Calculus: Lets users describe what they want, rather than how to compute it.
– Compute the cross-product of relation-list – Discard resulting tuples if they fail condition. – Delete attributes that are not in target-list – If DISTINCT is specified, eliminate duplicate rows. • This strategy is probably the least efficient way to compute a query! – An optimizer will find more efficient strategies to compute ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}