Semijoin and composition - sql, PL-SQL Programming

Semijoin and Composition - SQL

For semijoin, the dyadic relational operator MATCHING, defined thus:

r1 MATCHING r2, where r1 and r2 are relations such that r1 JOIN r2 is defined, is equivalent to

(r1 JOIN r2) {r1-attrs}

where r1-attrs is a commalist containing all and only the attribute names of r1.

and the example

COURSE MATCHING EXAM_MARK

is given as a relational expression for the predicate, "There exist a student StudentId and a mark Mark such that StudentId sat the exam and scored Mark marks for course CourseId and CourseId is entitled Title" (which could be abbreviated to "At least one student sat the exam for Course CourseId, entitled Title"). The resulting relation consists of just those tuples in COURSE that have at least one matching tuple in EXAM_MARK.

Posted Date: 1/18/2013 6:02:00 AM | Location : United States







Related Discussions:- Semijoin and composition - sql, Assignment Help, Ask Question on Semijoin and composition - sql, Get Answer, Expert's Help, Semijoin and composition - sql Discussions

Write discussion on Semijoin and composition - sql
Your posts are moderated
Related Questions
DBMS_PIPE: The Package DBMS_PIPE allows various sessions to communicate over the named pipes. (A pipe is a region of memory used by one of the process to pass information to

Updating by replacement Syntax: UPDATE ENROLMENT SET Name = 'Ann' WHERE StudentId = SID ('S1'); Note the use of SET, as already noted in connection with direct a

Using Savepoints The scope of the savepoint is a transaction in which it is defined. The Savepoints defined in the major transaction are not related to the savepoints defined

Implicit Cursors The Oracle implicitly opens a cursor to process each SQL statement not related with an explicitly declared cursor. The PL/SQL lets you refer to the most recen

Natural Join - SQL In the absence of NATURAL JOIN Example has to be replaced by something rather more longwinded, as shown in Example. Example: Joining IS_CALLED and IS_EN

Cause of Indeterminacy in SQL One root cause of indeterminacy in SQL lies in its implementation of comparison for equality. For certain system-defined types it is possible for

(a) What are decision support systems, and what role do they play in the business environment? (b) Data warehousing is defined as "a subject-oriented, integrated, non-volatile c

Defining and Declaring Records To create records, you have to define a RECORD type, and then declare records of that type. You may also define RECORD types in the declarative

CLOSE Statement The CLOSE statement allows the resources held by a cursor variable or open cursor to be reused. No more rows can be fetched from the cursor variable or closed

RETURN Statement The RETURN statement instantly completes the execution of a subprogram and returns control to the caller. The Execution then resumes with the statement below t