Bulk fetching - bulk bind performance improvement, PL-SQL Programming

Bulk Fetching

The illustration below shows that you can bulk-fetch from a cursor into one or more collections:

DECLARE

TYPE NameTab IS TABLE OF emp.ename%TYPE;

TYPE SalTab IS TABLE OF emp.sal%TYPE;

names NameTab;

sals SalTab;

CURSOR c1 IS SELECT ename, sal FROM emp WHERE sal > 1000;

BEGIN

OPEN c1;

FETCH c1 BULK COLLECT INTO names, sals;

...

END;

Posted Date: 10/4/2012 3:30:54 AM | Location : United States







Related Discussions:- Bulk fetching - bulk bind performance improvement, Assignment Help, Ask Question on Bulk fetching - bulk bind performance improvement, Get Answer, Expert's Help, Bulk fetching - bulk bind performance improvement Discussions

Write discussion on Bulk fetching - bulk bind performance improvement
Your posts are moderated
Related Questions
Main features of PL/SQL A good way to get familiar with PL/SQL is to look at a sample program. The below program processes an order for tennis rackets. At first, it declares a

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

The requirements as follows: Create a folder called "SECURITY" on the server and upload all your project files to that folder. Please note, the "SECURITY" folder is NOT to be IN

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

Using a join on 2 tables, select all columns and 10 rows from the 2 tables without the use of a Cartesian product. Query: SELECT * FROM EMPLOYEE1 E JOIN STAFF S ON E.EMP_

%FOUND Subsequent to a cursor or cursor variable is opened but before the first fetch, the %FOUND yields NULL. Afterward, it yields TRUE when the last fetch returned a row, or

Providing Results of Queries Expressing queries in SQL is the (big) subject. Here I present just a simple example to give you the flavour of things to come in those chapters.

Information Hiding   With the information hiding, you see only the details that are significant at a given level of algorithm and data structure design. The Information hiding

Keys in SQL SQL support for keys in the following respects: SQL does not require at least one key for every base table. If no key is explicitly declared, then KEY {ALL B

Effects of NULL Operator As a general rule-but not a universal one-if NULL is an argument to an invocation of a system-defined read-only operator, then NULL is the result of t