Can a stored procedure call itself, Database Management System

Assignment Help:

Can a stored procedure call itself or recursive stored procedure? How much level SP nesting is possible?

Yes. Because Transact-SQL supports recursion, you can write kept procedures that call themselves. Recursion can be explained as a method of problem solving wherein the solution is arrived at by repetitively applying it to subsets of the problem. A common application of recursive logic is to perform numeric computations that lend themselves to repetitive evaluation by the same processing steps. Stored procedures are nested when one kept procedure calls another or implements managed code by referencing a CLR routine, type, or aggregate. You can nest kept procedures and managed code references up to 32 levels.

 


Related Discussions:- Can a stored procedure call itself

Explain the hierarchical database model, Problem: (a) Briefly explain t...

Problem: (a) Briefly explain the ‘Hierarchical Database Model' using appropriate diagram. (b) List and briefly describe five potential benefits of the database approach comp

When are they useful justify with an example, When are they useful? Justify...

When are they useful? Justify with an example. The temporary tables are commonly used to support specialized rollups or exact application processing needs. Unlike a permanent t

Define the terms entity type and entity set, Define the terms i) Entity typ...

Define the terms i) Entity type ii) Entity set Entity type: An entity type describes a collection of entities that have the similar attributes. Entity set: The set of all en

Need for client server computing, Need for Client Server Computing- Client/...

Need for Client Server Computing- Client/Server (C/S) architecture includes running the application on multiple machines in which every machine with its component software tackles

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Functional dependencies and normalization for relational dat, Consider the ...

Consider the 1ollowin8 relation: CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., crui

List the steps for converting state diagram to the code, List the steps for...

List the steps for converting state diagram to the code. a) Finding major control path b) Finding the conditional statements  c) Finding the loops  d) Finding error ro

Development of large scale distributed real systems, Question: (a) What...

Question: (a) What are the challenges in the development of Large Scale Distributed Real Systems? (b) What is backward engineering and forward engineering in a design packa

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