RELATIONAL ALGEBRA IN SQL
Journal Title: INTERNATIONAL JOURNAL OF MATHEMATICS TRENDS AND TECHNOLOGY - Year 2013, Vol 4, Issue 2
Abstract
Relational Algebra is that branch of algebra which deals about set operations on a given relation such as UNION,INTERSECTION,DIFFERENCE,CARTESIAN PRODUCT, PROJECTION ,SELECTION. In this paper we shall discuss these operations in terms of SQL(STRUCTURED QUERY LANGUAGE).
Authors and Affiliations
Suresh Kumar, 2 R. B. S. Yadav
Keywords
Related Articles
- EP ID EP120624
- DOI -
- Views 83
- Downloads 0
Single Objective Evolutionary Algorithm for Job Shop Scheduling Problem
— Job shop scheduling belongs to the class of NPhard problems. There are a number of algorithms in literature for finding near optimal solution for the job shop scheduling problem. Many of these algorithms e...
Effect of Hall current on Unsteady Flow of a Dusty Conducting Fluid through porous medium between Parallel Porous Plates with Temperature Dependent Viscosity and Thermal Radiation
The purpose of present problem is to studies of effects of variable viscosity, hall current on unsteady laminar flow of dusty conducting fluid between parallel porous plates through porous medium with temperature...
Pulsatile Flow of Blood with Volume Fraction of Micro-organisms in the Presence of Transverse Magnetic Field through Stenosed Tube
This paper presents an analytical study of pulsatile flow of blood with micro-organisms through stenosed tubes in presence of transverse magnetic field.The effect of externally applied magnetic field on velocity, flow ra...
Influence of Non-Selective Harvesting and Prey Reserve Capacity on Prey-Predator Dynamics
In the present paper, we have developed a simple two species prey-predator model in which the prey dispersal in a two patch environment, one is assumed to be a free hunting zone and the other is a reserved zone where hun...
Equivalence Of Super Magic Labelings
Let G (V, E) be a graph with p vertices and q edges. A bijection f : V E {1,2,…., p+q} is called a super magic labeling of a graph G, if f(V) = {1, 2,…., p} and for any edge xyE, f(x)+f(y)+f(xy) = c(f), a const...