DATABASE FUNDAMENTALS
WHAT IS DATABASE MANAGEMENT
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Non-procedural
|
|
|
Procedural
|
|
|
Both (A) and (B)
|
|
|
None of the above
|
Detailed explanation-1: -Relational calculus is a non-procedural query language. In the non-procedural query language, the user is concerned with the details of how to obtain the end results. The relational calculus tells what to do but never explains how to do. The tuple relational calculus is specified to select the tuples in a relation.
Detailed explanation-2: -Relational algebra is a procedural query language, which takes instances of relations as input and yields instances of relations as output. It uses operators to perform queries. An operator can be either unary or binary.
Detailed explanation-3: -Relational Calculus is a Declarative (non-procedural) language.
Detailed explanation-4: -The Structured Query Language (SQL, pronounced “sequel” or “ess-que-ell”) is used to build and manipulate relational databases. It is a declarative, rather than a procedural, programming language.
Detailed explanation-5: -Relational calculus is a non-procedural query language. It is of two types: tuple and domain relational calculus. P(T) is condition to fetch the tuple T. It selects the tuple having author of book Operating system.