[Gpephone-devel] Which database is better to store tree structure?

Florian Boor florian.boor at kernelconcepts.de
Tue Apr 10 16:48:12 CEST 2007


Hi,

YANG Lin RD-ILAB-PEK schrieb:
> The data storage in calendaring enabler can be described as a tree
> structure:
>                             calendar
>                                   |
>                   ---------------------------------
>                   |                |               ...           
>        Component1    component2
> 	      |		|
> 	      |               .....  
>    ----------------------------------
>    |               |                 |
> Property1    property2     ...
>   |	            |
> ...           ----------------------------------
>              |           |          .....       |
>       parameter1 parameter2        value
...
> In above design , the "B. property value table" may contain more than
> one tables for  
> differrent value types.   To query a component , above several tables
> all need
> to be checked. It will be slow.
> Does anybody have any better idea to store such a tree structure?


it depends a little bit on the total amount of data and on how many different
data types you expect. I suppose a single table would work pretty well for this
purpose.

Greetings

Florian

-- 
The dream of yesterday                  Florian Boor
is the hope of today                    Tel: +49 271-771091-15
and the reality of tomorrow.            Fax: +49 271-771091-19
[Robert Hutchings Goddard, 1904]        florian.boor at kernelconcepts.de

1D78 2D4D 6C53 1CA4 5588  D07B A8E7 940C 25B7 9A76



More information about the Gpephone-devel mailing list