Home » Developer & Programmer » Forms » Binary tree or Trie
Binary tree or Trie [message #78581] Mon, 04 March 2002 09:41 Go to next message
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
Re: Binary tree or Trie [message #78595 is a reply to message #78581] Tue, 05 March 2002 00:26 Go to previous messageGo to next message
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;
Re: Binary tree or Trie [message #78599 is a reply to message #78595] Tue, 05 March 2002 01:43 Go to previous message
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
Previous Topic: Master Detail Delete
Next Topic: Re: Master Detail Delete
Goto Forum:
  


Current Time: Mon Aug 03 07:44:42 CDT 2020