Here i have uploaded the previous year (2014 November) question paper of Database management systems (C S, IT) for Fifth semester for Computer science and engineering (CS or CSE) and information technology (IT) branches under MG university BTech course.
Course : B.Tech Engineering (degree)
University: MG university (Mahatma Gandhi university) Kottayam, Kerala
Department or branch: Computer science and engineering (CS or CSE) and Information Technology (IT)
Showing posts with label DBMS. Show all posts
Showing posts with label DBMS. Show all posts
Relational Algebra - Selection, Projection, Joins etc
The relational algebra defines a set of operations on relations, paralleling the usual algebraic operations such as addition, subtraction etc which operate on numbers.The relational algebra operations take one or two relations (tables) as input and return a relation as output. This post we discuss the following relational operations:
- Selection (σ)
- Projection (π)
- Cartesian product
- Joins
Selection Operation (σ)
Algorithm, C and C++ Programs to find Closure From Functional Dependencies
In this post we will see how to find closure of an attribute or a set of attributes. Before learning how to get closure, we should first know what is a closure. Closure of a given set C is the set of attributes that are functionally determined by the set C under the set of functional dependencies F. There can be closure for any set. Every attribute in the set whose closure is to be found out, will be a member of its closure set C+ also. Consider an example:
Subscribe to:
Posts
(
Atom
)