recursive calls versus memory sorts - dBforums

Welcome to the dBforums forums.

You are currently viewing our boards as a guest which gives you limited access to view most discussions, articles and access our other FREE features. By joining our free community you will have access to post topics, communicate privately with other members (PM), respond to polls, upload your own photos and access many other special features. Registration is fast, simple and absolutely free so please, join our community today!

If you have any problems with the registration process or your account login, please contact contact support.

If you prefer not to see double-underlined words and corresponding ads, place your cursor

here for ContentLink opt out.

> recursive calls versus memory sorts

Reply

Search this Thread

#1 (permalink)

Old

12-04-03, 10:01

Naweed

Naweed is offline

Registered User

Join Date: Nov 2003

Posts: 46

Question

recursive calls versus memory sorts

What is a better tuned query. One which has less recursive calls or one which has less memory sorts.

Reply With Quote

#2 (permalink)

Old

12-04-03, 10:12

N-ary

N-ary is offline

Registered User

Join Date: Oct 2003

Posts: 87

Re: recursive calls versus memory sorts

Quote:

Originally posted by Naweed
What is a better tuned query. One which has less recursive calls or one which has less memory sorts.

Impossible to answer, it depends. Need examples, data structure and volumes, system platform capabilities.

__________________
Oracle - DB2 - MS Access -

Reply With Quote

Reply

« Previous Thread | Next Thread »

Thread Tools	Search this Thread
Show Printable Version Email this Page	Search this Thread: Advanced Search
Display Modes
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts vB code is On Smilies are On [IMG] code is Off HTML code is Off Trackbacks are On Pingbacks are On Refbacks are On