Hi all!

I have a class structure like this one, which seemed a good idea from
an OOP standpoint:

Node (Abstract)
\-> Folder
\-> Page
\-> Article
\-> File

The idea was that everything is a node (this is a CMS) and everything
can contain other nodes and have only one parent node. So Articles can
contain Files, and Folders can contain Articles, and so on. In theory
this worked quite well.
The thing is that the Node subclasses are growing in number and the
number of objects in the database is growing as well, and the
performance is degrading.
The mapping is done using <joined-subclass> and therefore, making a
query to get the child nodes makes a huge query (with a lot of joins)
which is slow when there are a lot of children in different places.

Do you have any idea on how could I map this to avoid complex queries
without losing the benefits of having heterogeneous children in each
node?

Thanks.

-- 
You received this message because you are subscribed to the Google Groups 
"nhusers" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/nhusers?hl=en.

Reply via email to