Keyword and parameter description - delete statement, PL-SQL Programming

Assignment Help:

Keyword and Parameter Description:

table_reference:

This specifies a table or view that should be accessible when you execute the DELETE statement, and for that you must have DELETE privileges.

Subquery:

This is a SELECT statement which provides a set of rows for the processing. Its syntax is such that of select_into_statement without the INTO clause.

TABLE (subquery2):

The operand of the TABLE is a SELECT statement which returns a single column value, that should be a nested table or a varray cast as a nested table. The Operator TABLE informs the Oracle that the value is a collection, but not a scalar value.

Alias:

This is another (generally short) name for the referenced table or view and is usually used in the WHERE clause.

WHERE search_condition:

This clause provisionally chooses the rows to be deleted from the referenced table or the view. Only rows which meet the search condition are deleted. If you omit the WHERE clause, then all rows in the table or view are deleted.

WHERE CURRENT OF cursor_name:

This clause refers to the most recent row processed by the FETCH statement related with the cursor identified by the cursor_name. The cursor should be FOR UPDATE and should be open and placed on a row. When the cursor is not open, the CURRENT OF clause causes an error.

When the cursor is open, but no rows have been fetched or the last fetch returned no rows, then PL/SQL raises the predefined exception NO_DATA_FOUND.

returning_clause:

This clause returns values from the deleted rows, by this means eliminating the need to SELECT the rows ahead of time. You can retrieve the column values into the variables and/or host variables, or into the collections and/or host arrays. Though, you cannot use the RETURNING clause for remote or parallel deletes.

BULK COLLECT:

These clauses instruct the SQL engine to bulk-bind the output collections before returning them to the PL/SQL engine. The SQL engine bulk-binds all the collections referenced in the RETURNING INTO list. The corresponding columns should store scalar (and not the composite) values. 


Related Discussions:- Keyword and parameter description - delete statement

Keyword and parameter description - goto statement, Keyword and Parameter D...

Keyword and Parameter Description: label_name: This is an undeclared identifier which labels an executable statement or the PL/SQL block. You can use a GOTO statement to

Join and and in sql, JOIN and AND in SQL In this Section is all about ...

JOIN and AND in SQL In this Section is all about one operator, JOIN. SQL's closest counterpart, NATURAL JOIN, has already been covered. Here we look at several other "join" op

Fetching with a cursor, Fetching with a Cursor The FETCH statements re...

Fetching with a Cursor The FETCH statements retrieve the rows in the result set one at a time. After each and every fetch, the cursor advance to the next row in the result set

Pl/sql assignment, 1. a. Write a trigger that fires when a part's price...

1. a. Write a trigger that fires when a part's price is updated. The trigger will write a record into a table called PriceUpdates. The record should contain the information of

Parameter and keyword description - records, Parameter and Keyword Descript...

Parameter and Keyword Description: record_type_name: This identifies the user-defined type specifier that is used in the subsequent declarations of the records. NOT N

Logical operators-pl/sql expressions , Logical Operators The logical op...

Logical Operators The logical operators AND, NOT, and OR follow the tri-state logic shown in table below. The AND and OR are binary operators; NOT is a unary operator.

Expressions - syntax, Expressions   An expression is a randomly comple...

Expressions   An expression is a randomly complex combination of the constants, variables, literals, operators, & function calls. The simplest expression is the single variabl

Relational algebra - sql, Relational Algebra - SQL It describes some ...

Relational Algebra - SQL It describes some operators, that together constitute an algebra that is not only relationally complete but also irreducibly so (very nearly- apart f

Biconditional - sql, Biconditional - SQL The biconditional p ↔ q can b...

Biconditional - SQL The biconditional p ↔ q can be expressed in Tutorial D by p = q and the same is true of SQL. The question then arises as to whether, in SQL, p = q is equiv

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd