Title
Avalanche-safe LINQ compilation
Abstract
We report on a query compilation technique that enables the construction of alternative efficient query providers for Microsoft's Language Integrated Query (LINQ) framework. LINQ programs are mapped into an intermediate algebraic form, suitable for execution on any SQL:1999-capable relational database system. This compilation technique leads to query providers that (1) faithfully preserve list order and nesting, both being core features of the LINQ data model, (2) support the complete family of LINQ's Standard Query Operators, (3) bring database support to LINQ to XML where the original provider performs in-memory query evaluation, and, most importantly, (4) emit SQL statement sequences whose size is only determined by the input query's result type (and thus independent of the database size). A sample query scenario uses this LINQ provider to marry database-resident TPC-H and XMark data---resulting in a unique query experience that exhibits quite promising performance characteristics, especially for large data instances.
Year
DOI
Venue
2010
10.14778/1920841.1920866
PVLDB
Keywords
Field
DocType
linq data model,query compilation technique,unique query experience,sample query scenario,in-memory query evaluation,input query,avalanche-safe linq compilation,1999-capable relational database system,linq provider,linq program,alternative efficient query provider,database system,data model
Query optimization,Data mining,RDF query language,Query language,Programming language,Query expansion,Computer science,Sargable,Web query classification,View,Query by Example,Database
Journal
Volume
Issue
ISSN
3
1-2
2150-8097
Citations 
PageRank 
References 
17
0.93
20
Authors
3
Name
Order
Citations
PageRank
Torsten Grust11482148.79
Jan Rittinger251229.20
Tom Schreiber3813.95