> I haven't actually used LINQ so my understanding might be a bit flawed. But > from what I have seen LINQ is rather limited in performance. Doesn't it kind > of default to just pulling up the table in RAM and do filtering and joins on > the fetched data?
Not at all. LINQ revolves around expression trees, you capture the intention of the query itself at compile time and pass it to a data provider at runtime. If you run against a DBMS provider, it will take care of the composition through delayed execution, only when you actually start iterating over the data is the query actually compiled, optimized and executed. This is in stark contrast to the alternative of an embedded external DSL like HQL/JPQL or a naive developer walking a relational hierarchy that drowns the database in a gazillion small queries. The beauty of the whole thing though is how unifying it is, you can query just about anything - would love to see this for Java. /Casper --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "The Java Posse" 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/javaposse?hl=en -~----------~----~----~----~------~----~------~--~---
