Click here to Skip to main content
15,896,118 members
Articles / Programming Languages / SQL

Improving Entity Framework Query Performance Using Graph-Based Querying

Rate me:
Please Sign up or sign in to vote.
4.88/5 (14 votes)
29 Aug 2011CPOL14 min read 95.5K   60  
This document presents a new, graph-based, way for expressing and executing Microsoft ADO.Net Entity Framework queries. Using an extensive performance comparison, we show that Graph-based Querying (GBQ) easily outperforms traditional querying with LINQ in terms of expressiveness and performance.
No downloads associated with this content

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Netherlands Netherlands
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions