Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
In a database we create indexes on columns that we want to query with joins.
Does Linq to objects facilitate this in any way?
I imagine that search performance could be (much) improved when somehow List’s can be supported by binary trees (indexes) in memory that are mapped to specific properties of T.
I am thinking of Lists that do not have to be optimized for inserts or deletes.
One could turn off the index for another optimization.
No; LINQ does not use indexes.
Instead, you can use i4o, which does.
Note that many LINQ operations, such as
Distinct,Join,GroupBy, and others, will build a hasttable (or hashset, as appropriate) to avoid O(n2) performance.For more information, see Jon Skeet’s EduLINQ series.