Results 1 to 2 of 2

Thread: optimal binary search tree in database

Thread Tools
Display
- Switch to Linear Mode
- Hybrid Mode
- Switch to Threaded Mode

Hybrid View

Previous Post

Next Post

01-20-2015, 10:59 AM #1
skhanal

View Profile

View Forum Posts

Experts
Join Date

Nov 2002

Location

New Jersey, USA

Posts

3,932
In general lower the depth of the tree and balanced the tree, it is more efficient.

http://databaseandstorage.blogspot.com
http://gotodba.weebly.com

Reply With Quote

Quick Navigation Oracle Top

« Previous Thread | Next Thread »

Tags for this Thread

database, oracle, sql server

Posting Permissions

You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is Off
[VIDEO] code is Off
HTML code is Off

Terms of Service | About Us | Privacy Notice | Contact Us | Advertise | Sitemap| California - Do Not Sell My Info

Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.

All times are GMT -5. The time now is 10:27 PM.