A Practical Theory of Language-Integrated Query with Quill
Download as PPSX, PDF0 likes246 views
Quill is a compile-time language integrated query library with a powerful query compilation mechanism based on the paper "A Practical Theory of Language-Integrated Query". This talk will give an overview of the query compilation, present the Quoted Domain Specific Language (QDSL) approach, and give a quick view of Quill's functionality and internals.
![val range = quote {
(a: Int, b: Int) =>
for {
u <- query[Person]
if (a <= u.age && u.age < b)
} yield {
u
}
}
db.run(range(10, 20))
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-17-320.jpg)
![val range = quote {
(a: Int, b: Int) =>
for {
u <- query[Person]
if (a <= u.age && u.age < b)
} yield {
u
}
}
db.run(range(10, 20))
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-18-320.jpg)
![val range = quote {
(a: Int, b: Int) =>
for {
u <- query[Person]
if (a <= u.age && u.age < b)
} yield {
u
}
}
db.run(range)(min, max)
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-19-320.jpg)
![val satisfies =
quote {
(p: Int => Boolean) =>
for {
u <- query[Person] if (p(u.age))
} yield {
u
}
}
db.run(satisfies((x: Int) => 20 <= x))
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-21-320.jpg)
![val satisfies =
quote {
(p: Int => Boolean) =>
for {
u <- query[Person] if (p(u.age))
} yield {
u
}
}
db.run(satisfies((x: Int) => 20 <= x))
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-22-320.jpg)
![val ageFromName = quote {
(s: String) =>
for {
u <- query[Person] if (s == u.name)
} yield {
u.age
}
}
quote {
(s: String, t: String) =>
for {
a <- ageFromName(s)
b <- ageFromName(t)
r <- range(a, b)
} yield {
r
}
}
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-24-320.jpg)
![val ageFromName = quote {
(s: String) =>
for {
u <- query[Person] if (s == u.name)
} yield {
u.age
}
}
quote {
(s: String, t: String) =>
for {
a <- ageFromName(s)
b <- ageFromName(t)
r <- range(a, b)
} yield {
r
}
}
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-25-320.jpg)
![sealed trait Predicate
case class Above(i: Int) extends Predicate
case class Below(i: Int) extends Predicate
case class And(a: Predicate, b: Predicate) extends Predicate
case class Or(a: Predicate, b: Predicate) extends Predicate
case class Not(p: Predicate) extends Predicate
def eval(t: Predicate): Quoted[Int => Boolean] =
t match {
case Above(n) => quote((x: Int) => x > lift(n))
case Below(n) => quote((x: Int) => x < lift(n))
case And(t1, t2) => quote((x: Int) => eval(t1)(x) && eval(t2)(x))
case Or(t1, t2) => quote((x: Int) => eval(t1)(x) || eval(t2)(x))
case Not(t0) => quote((x: Int) => !eval(t0)(x))
}
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-27-320.jpg)
![sealed trait Predicate
case class Above(i: Int) extends Predicate
case class Below(i: Int) extends Predicate
case class And(a: Predicate, b: Predicate) extends Predicate
case class Or(a: Predicate, b: Predicate) extends Predicate
case class Not(p: Predicate) extends Predicate
def eval(t: Predicate): Quoted[Int => Boolean] =
t match {
case Above(n) => quote((x: Int) => x > lift(n))
case Below(n) => quote((x: Int) => x < lift(n))
case And(t1, t2) => quote((x: Int) => eval(t1)(x) && eval(t2)(x))
case Or(t1, t2) => quote((x: Int) => eval(t1)(x) || eval(t2)(x))
case Not(t0) => quote((x: Int) => !eval(t0)(x))
}
@vonjuliano](https://image.slidesharecdn.com/quill-180301134917/85/A-Practical-Theory-of-Language-Integrated-Query-with-Quill-28-320.jpg)
![Parallels Desktop Crack [Latest] 2025 free](https://cdn.slidesharecdn.com/ss_thumbnails/worlddayofbullyingpreventionactivitiesinfographicsbyslidesgo-250228090445-a5019b4d-250403064534-1338-250406211207-5ba8239d-thumbnail.jpg?width=560&fit=bounds)
More Related Content
Recently uploaded (20)
Featured (20)
A Practical Theory of Language-Integrated Query with Quill
- 1. A PRACTICAL THEORY OF LANGUAGE-INTEGRATED QUERY WITH QUILL JULIANO ALVES @vonjuliano
- 2. @vonjuliano
- 3. @vonjuliano
- 5. A PRACTICAL THEORY OF LANGUAGE- INTEGRATED QUERY @vonjuliano http://homepages.inf.ed.ac.uk/slindley/papers/practical-theory-of-linq.pdf
- 6. SCYLLA FAILURE CHARYBDIS AVALANCHE @vonjuliano
- 7. @vonjuliano
- 8. @vonjuliano
- 9. RESTRICTIONS SINGLE DB RETURNS A FLAT RELATION TYPE ONLY KNOWN OPERATIONS @vonjuliano
- 10. SELECT w.NAME, w.age m.age, FROM couples c, people w, people m WHERE c.her = w.NAME AND c.him = m.NAME AND w.age > m.age @vonjuliano
- 11. quote { for { c <- couples w <- people m <- people if (c.her == w.name && c.him == m.name && w.age > m.age) } yield { (w.name, w.age - m.age) } } @vonjuliano
- 12. quote { for { c <- couples w <- people m <- people if (c.her == w.name && c.him == m.name && w.age > m.age) } yield { (w.name, w.age - m.age) } } @vonjuliano
- 14. @vonjuliano
- 15. FlatMap(Entity(Couple,None,List()),Ident(c),FlatMap(Entity(Pe rson,None,List()),Ident(w),Map(Filter(Entity(Person,None,List( )),Ident(m),BinaryOperation(BinaryOperation(BinaryOperation (Property(Ident(c),her),==,Property(Ident(w),name)),&&,Binary Operation(Property(Ident(c),him),==,Property(Ident(m),name)) ),&&,BinaryOperation(Property(Ident(w),age),>,Property(Ident (m),age)))),Ident(m),Tuple(List(Property(Ident(w),name), BinaryOperation(Property(Ident(w),age),- ,Property(Ident(m),age))))))) SELECT w.NAME, w.age m.age, FROM couples c, people w, people m WHERE c.her = w.NAME AND c.him = m.NAME AND w.age > m.age + = @vonjuliano
- 17. val range = quote { (a: Int, b: Int) => for { u <- query[Person] if (a <= u.age && u.age < b) } yield { u } } db.run(range(10, 20)) @vonjuliano
- 18. val range = quote { (a: Int, b: Int) => for { u <- query[Person] if (a <= u.age && u.age < b) } yield { u } } db.run(range(10, 20)) @vonjuliano
- 19. val range = quote { (a: Int, b: Int) => for { u <- query[Person] if (a <= u.age && u.age < b) } yield { u } } db.run(range)(min, max) @vonjuliano
- 20. ABSTRACTING OVER A PREDICATE
- 21. val satisfies = quote { (p: Int => Boolean) => for { u <- query[Person] if (p(u.age)) } yield { u } } db.run(satisfies((x: Int) => 20 <= x)) @vonjuliano
- 22. val satisfies = quote { (p: Int => Boolean) => for { u <- query[Person] if (p(u.age)) } yield { u } } db.run(satisfies((x: Int) => 20 <= x)) @vonjuliano
- 24. val ageFromName = quote { (s: String) => for { u <- query[Person] if (s == u.name) } yield { u.age } } quote { (s: String, t: String) => for { a <- ageFromName(s) b <- ageFromName(t) r <- range(a, b) } yield { r } } @vonjuliano
- 25. val ageFromName = quote { (s: String) => for { u <- query[Person] if (s == u.name) } yield { u.age } } quote { (s: String, t: String) => for { a <- ageFromName(s) b <- ageFromName(t) r <- range(a, b) } yield { r } } @vonjuliano
- 27. sealed trait Predicate case class Above(i: Int) extends Predicate case class Below(i: Int) extends Predicate case class And(a: Predicate, b: Predicate) extends Predicate case class Or(a: Predicate, b: Predicate) extends Predicate case class Not(p: Predicate) extends Predicate def eval(t: Predicate): Quoted[Int => Boolean] = t match { case Above(n) => quote((x: Int) => x > lift(n)) case Below(n) => quote((x: Int) => x < lift(n)) case And(t1, t2) => quote((x: Int) => eval(t1)(x) && eval(t2)(x)) case Or(t1, t2) => quote((x: Int) => eval(t1)(x) || eval(t2)(x)) case Not(t0) => quote((x: Int) => !eval(t0)(x)) } @vonjuliano
- 28. sealed trait Predicate case class Above(i: Int) extends Predicate case class Below(i: Int) extends Predicate case class And(a: Predicate, b: Predicate) extends Predicate case class Or(a: Predicate, b: Predicate) extends Predicate case class Not(p: Predicate) extends Predicate def eval(t: Predicate): Quoted[Int => Boolean] = t match { case Above(n) => quote((x: Int) => x > lift(n)) case Below(n) => quote((x: Int) => x < lift(n)) case And(t1, t2) => quote((x: Int) => eval(t1)(x) && eval(t2)(x)) case Or(t1, t2) => quote((x: Int) => eval(t1)(x) || eval(t2)(x)) case Not(t0) => quote((x: Int) => !eval(t0)(x)) } @vonjuliano
- 30. @vonjuliano
- 31. A PRACTICAL THEORY OF LANGUAGE-INTEGRATED QUERY WITH QUILL JULIANO ALVES @vonjuliano THANK YOU!
- 32. Q U E S T I O N S ? @vonjuliano
Editor's Notes
- #5: Compile-time Language Integrated Query for Scala Boilerplate-free mapping: The database schema is mapped using simple case classes Quoted DSL: Quill parses each quoted block of code (quotation) at compile time and translates them to an internal Abstract Syntax Tree (AST) Compile-time query generation: The油ctx.run油call reads the quotation's AST and translates it to the target language at compile time Compile-time query validation:油(optional) the query is verified against the database at compile time and the compilation fails if it is not valid
- #6: Failure and avalanche
- #7: each query in the host language generate exactly one SQL query
- #30: Failure and avalanche