Sharing data in a data structure

[Laszlo Varga]

Hello,
what about a common database, and structures storing the selection patterns?

/Laszlo Varga

> X-Originating-IP: [194.237.142.13]
> From: "Vlad Dumitrescu" <vladdu@REDACTED>
> To: erlang-questions@REDACTED
> Subject: Sharing data in a data structure
> Date: Thu, 17 Jan 2002 12:42:19 +0100
> Mime-Version: 1.0
> X-OriginalArrivalTime: 17 Jan 2002 11:42:19.0329 (UTC) 
FILETIME=[04FFD310:01C19F4C]
> 
> Hi folks!
> 
> I just begun a project where the main data structure is a graph that shares 
> a lot of data across branches and also with other graphs. Since we have no 
> pointers here :-) the simplest alternative I came up with is to use indexes 
> in a list or table instead. But I am a little worried because there will be 
> a lot of searching when traversing the structure...
> 
> My question is: is there another way to do it? Maybe a different paradigm 
> may be used, but myself I cannot escape from this one...
> 
> Duplicating the data is not acceptable, because it is necessary that a 
> change in one place will be reflected everywhere. And it would also result 
> in a humungous amount of data.
> 
> Thank you in advance. Regards,
> Vlad
> 
> _________________________________________________________________
> MSN Photos är det enklaste sättet att dela ut och skriva ut foton: 
> http://photos.msn.se/Support/WorldWide.aspx
>