Xml parsing for large NESTED Data Structures are too slow. I probably will
have
around 150,000 Unique ID's in the Tree data Structure which can go deep as
1000 Levels. I am looking to avoid sequencial/Recursive search.
Joe Eugene
-----Original Message-----
From: Rob [mailto:[EMAIL PROTECTED]
Sent: Monday, March 01, 2004 8:24 PM
To: CF-Talk
Subject: Re: OT: A Good Data Structure for a Large Binary Tree
Lots of data? why not xml?
On Mon, 2004-03-01 at 17:11, Joe Eugene wrote:
> I am trying to solve a Binary Tree data structure problem, i think this
> can be done from a DataBase Perspective with relations but then that
> might involve doing something like a matrix to develop the relations
> between nodes.
>
> The other thought i have is solve the problem by using some
native(Java/C++)
> data Structure (Binary Tree /TreeMap) and store keys of the database
> structure
> as keys of the Binary Tree... that might relate to a simple select.
>
> Any ideas are much appreciated.
>
> Thanks,
> Joe Eugene
>
>
>
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings]
