0
The main operations of relational algebra are
1. The select Operation
2. The projection operation
3. The union operation
4.The set different operations
5.The Cartesian-product operation.
6.The rename operation.
7.Additional operations.
8.The Set-Intersection operations.
9.Natural-join operations.
10.Division operation.
11.The Assignment operation.
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
Why relational algebra is a procedural query language?
The syntax of a query in relational algebra essentially describes the query evaluation algorithm i.e. SELECT WHERE FROM --------------- I don't agree with the above answer. Notice that 'SELECT WHERE FROM' is fragmentary SQL. It does not describe an algorithm, or procedure, for obtaining the desired results. Rather, it describes the characteristics of the desired results and where they might be obtained. In fact, relational algebra is not inherently procedural. It involves closed collections of objects called relations and a set of permitted operations on these objects. Please see the link.
A combination of operations on variables and numbers is called an?
This is called algebra. In algebra you can have many operations. You can add, subtract, multiply, divide, square, cube, square root, factor, or distribute. There are others but these are the main ones. You use these operations to find the numerical value of the variable.
How can you use inverse operations to solve an equation without algebra titles?
Without algebra tiles?
What mathematical operations can the MARK I you execute?
math algebra
Solve problems using the order of operations?
Language of Algebra
Explain the select Operation in Relational Algebra with an example?
Relational Algebra - Example
What are the different types of database languages?
Two main types: Relational Calculus based Language Relational Algebra based Language. These languages provide similar set of operations but with different syntax. Calculus based is more kind of procedural and near to English, while Algebra based uses a set of symbols for queries.
Unary and binary operators in relational Algebra?
The nnary and Binary operators in relational Algebra.
What is the utility of relational algebra relational calculas name some software's based on these concept?
What is the utility of relational algebra relational calculas name some software's based on these concept?"
Is relational algebra under abstract algebra?
yes
Software on relational algebra?
Oracle8i
Which relational algebra operators can be applied to pair of tables that are not union compatible?
Which relational algebra operators can be applied to a pair of tables that are not union compatible
Explain the different operations used in relational algebra with suitable examples?
This is a big question. I you enter 'relational algebra' in a search engine, you will find many sites which go over this. Wikipedia usually takes a very high level abstract approach. The link below seems fairly easy to understand.
Which relational algebra operators can be applied to a pair of tables that are not union compatible?
Which relational algebra operators can be applied to a pair of tables that are not union compatible
Describe basic operation of relational algebra?
CHUT
Why relational algebra is a procedural query language?
The syntax of a query in relational algebra essentially describes the query evaluation algorithm i.e. SELECT WHERE FROM --------------- I don't agree with the above answer. Notice that 'SELECT WHERE FROM' is fragmentary SQL. It does not describe an algorithm, or procedure, for obtaining the desired results. Rather, it describes the characteristics of the desired results and where they might be obtained. In fact, relational algebra is not inherently procedural. It involves closed collections of objects called relations and a set of permitted operations on these objects. Please see the link.
What are the main differences between relational algebra and relational calculus?
Relation algebra is a procedural language where relation calculus is non-procedural languageRelational algebra, an offshoot of first-orderlogic (and of algebra of sets), deals with a set of finitaryrelations (see also relation (database)) which is closed under certain operators. These operators operate on one or more relations to yield a relation. Relational algebra is a part of computer science.Relational calculus consists of two calculi, the tuplerelational calculus and the domain relational calculus, that are part of the relational model for databases and provide a declarative way to specify database queries. This in contrast to the relational algebra which is also part of the relational model but provides a more procedural way for specifying queries.The relational algebra might suggest these steps to retrieve the phone numbers and names of book stores that supply Some Sample Book:1. Join books and titles over the BookstoreID.2. Restrict the result of that join to tuplesfor the book Some Sample Book.3. Project the result of that restriction over StoreNameand StorePhone.The relational calculus would formulate a descriptive, declarative way:Get StoreNameand StorePhonefor supplies such that there exists a title BK with the same BookstoreIDvalue and with a BookTitlevalue of Some Sample Book.The relational algebra and the relational calculus are essentially logically equivalent: for any algebraic expression, there is an equivalent expression in the calculus, and vice versa.This result is known as Codd'stheorem
