what is a performance way to 'tree-walking' through my Entity Framework data

Posted by Greg on Stack Overflow See other posts from Stack Overflow or by Greg
Published on 2010-05-30T04:58:12Z Indexed on 2010/05/30 5:02 UTC
Read the original article Hit count: 248

Hi,

I have a Entity Framework design with a few tables that define a "graph". So there can be a large chain of relationships between objects in the few tables via concept of parent/child relationships.

What is a performance way to 'tree-walking' through my Entity Framework data?

That is I assume I wouldn't want to load the full set of all NODES and RELATIONSHIPS from the database for the purpose of walking the tree, where the end result may only be identifying leaf nodes? Or would this be OK with the way lazy loading may work at the column/parameter level?

Else how could I load just the skeleton of the objects and then when needing to refer to any attributes have them lazy load then?

© Stack Overflow or respective owner

Related posts about c#

Related posts about entity-framework