Ah yes, I see. Thanks!
On Monday, December 9, 2013 6:00:19 PM UTC-8, Jamie Brandon wrote:
>
> Both the denormalised view and the query on it are represented as LINQ
> queries. The compiler then optimises the composition of the two and returns
> something that acts directly on the database withou
Both the denormalised view and the query on it are represented as LINQ
queries. The compiler then optimises the composition of the two and returns
something that acts directly on the database without building up an
intermediate representation. It seems to me that the same technique should
work for
That part that seemed relevant to your question is compile queries on
denormalised views to queries on normalised databases.
On 9 December 2013 22:07, Brian Craft wrote:
> Very interesting paper, thanks. Seem to be more about LINQ to SQL, though:
> translating queries in a host language to sql
Very interesting paper, thanks. Seem to be more about LINQ to SQL, though:
translating queries in a host language to sql queries against a db. It
doesn't, for example, address indexing in-memory data.
On Monday, December 9, 2013 11:23:36 AM UTC-8, Jamie Brandon wrote:
>
> Take a look at "A pract
Take a look at "A practical theory of language-integrated query" at
http://homepages.inf.ed.ac.uk/wadler/topics/recent.html . In the FPDays
talk linked there Wadler demonstrated writing queries which returned
denormalised views on tables, composing those with queries on the
denormalised view and co
Slightly OT, but I know many of you have read OOTTP.
This paper describes a hypothetical relational modeling infrastructure that
allows declaring indexes on and writing queries against denormalized tables
as though they were normalized tables. The point of this is to eliminate
the complexity th
