I have these classes:



The topNode is the top of a tree of Nodes. Each Node can belong only to one Scorecard. I have tried several implementation variants, but it always take several seconds before the tree of 3000 nodes is built.

How should I design my database and mapping files to get a good performance?

/Calle

Enable lazy loading for class Node. You will need to use properties to access the fields. Make those properties (and any methods) of Node virtual.

Problem is that most of the tree must be traversed before deciding what the user should see. So I really want it to fetch ALL nodes belonging to that Scorecard and build a tree structure.

How do I do this most effectively? How should the database scheme and mapping look like?

Then you should use a query to tell NH what you want to fetch, but proxying will help avoid loading those objects that you don't need.