OraFAQ Forum: Forms » Binary tree or Trie

Home » Developer & Programmer » Forms » Binary tree or Trie

Show: Today's Messages :: Polls :: Message Navigator
E-mail to friend

Binary tree or Trie [message #78581]

Mon, 04 March 2002 09:41

Sandro
Messages: 6
Registered: March 2002

Junior Member

I am studying the problem of the Date Cleaning For Data Warehouse.

I have created a new algorithm for "the duplicate
records problem", and I have implemented the algorithm
in c++ and java language.

the "data-structure" used it is the "Trie" + "Tree";
now, to improve, I would like to implement the algorithm using the PL-SQL, but I don't succeed in finding examples of as to manage "the search" in a Binary-Tree in PL-SQL language.

Do I have to use the Nested-Tables?.

Can you help me?

Thanks.

Sandro Pennisi

Report message to a moderator

Re: Binary tree or Trie [message #78595 is a reply to message #78581]

Tue, 05 March 2002 00:26

pratap kumar tripathy
Messages: 660
Registered: January 2002

Senior Member

pl/sql is not flexible enough to do that.

one option is to create a temporary table like below and treat it as a tree

table_name
----------
id number;
---other details goes here---
parent_id number;

Report message to a moderator

Re: Binary tree or Trie [message #78599 is a reply to message #78595]

Tue, 05 March 2002 01:43

Sandro
Messages: 6
Registered: March 2002

Junior Member

-----------------Original Post----------------------
pl/sql is not flexible enough to do that.
one option is to create a temporary table like below and treat it as a tree

table_name
----------
id number;
---other details goes here---
parent_id number;

---------------------------------------------------

hello,
how do I manage the recursion with this
data-structure?

thanks.
Sandro

Report message to a moderator

Previous Topic:	Master Detail Delete
Next Topic:	Re: Master Detail Delete

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

]

Current Time: Fri May 02 15:19:01 CDT 2025