Language-integrated query with ordering, grouping and outer joins

Tatsuya Katsushima; Oleg Evgenievich Kiselyov

doi:10.1145/3018882.3018893

Language-integrated query with ordering, grouping and outer joins

Tatsuya Katsushima, Oleg Evgenievich Kiselyov

INF - Computer and Mathematical Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

Language-integrated query systems like T-LINQ or QUEA make relational operations on (generally external) data feel like the ordinary iteration over native arrays. As ordinary programs, queries are type-checked, can be abstracted over and composed. To access relational database systems, queries are eventually translated into well-formed, well-typed and efficient SQL. However, most existing language-integrated query systems implement only a small subset of relational operations supported by modern databases. To make QUEA full-featured, we add to it the operations corresponding to SQL's ORDER BY, LIMIT, OUTER JOIN, GROUP BY and HAVING. We describe the type system and the normalization rules to produce the efficient SQL code. The type system not only ensures by construction the intricate SQL validity constraints. It also prevents the accidental composition of hard-to-optimize queries. Our extended QUEA is embedded in OCaml in the tagless-final style.

Original language	English
Title of host publication	PEPM 2017 - Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, co-located with POPL 2017
Publisher	Association for Computing Machinery, Inc
Pages	123-124
Number of pages	2
ISBN (Electronic)	9781450347211
DOIs	https://doi.org/10.1145/3018882.3018893
Publication status	Published - 2017 Jan 2
Event	2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017 - Paris, France Duration: 2017 Jan 16 → 2017 Jan 17

Other

Other	2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017
Country/Territory	France
City	Paris
Period	17/1/16 → 17/1/17

Keywords

EDSL
Language-integrated query
LINQ
SQL
Tagless-final

ASJC Scopus subject areas

Software
Computer Graphics and Computer-Aided Design
Computer Vision and Pattern Recognition

Access to Document

10.1145/3018882.3018893

Cite this

Language-integrated query with ordering, grouping and outer joins. / Katsushima, Tatsuya; Kiselyov, Oleg Evgenievich.
PEPM 2017 - Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, co-located with POPL 2017. Association for Computing Machinery, Inc, 2017. p. 123-124.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Katsushima, T & Kiselyov, OE 2017, Language-integrated query with ordering, grouping and outer joins. in PEPM 2017 - Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, co-located with POPL 2017. Association for Computing Machinery, Inc, pp. 123-124, 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017, Paris, France, 17/1/16. https://doi.org/10.1145/3018882.3018893

@inproceedings{d47b3de7a8f543529f29afca0e69977a,

title = "Language-integrated query with ordering, grouping and outer joins",

abstract = "Language-integrated query systems like T-LINQ or QUEA make relational operations on (generally external) data feel like the ordinary iteration over native arrays. As ordinary programs, queries are type-checked, can be abstracted over and composed. To access relational database systems, queries are eventually translated into well-formed, well-typed and efficient SQL. However, most existing language-integrated query systems implement only a small subset of relational operations supported by modern databases. To make QUEA full-featured, we add to it the operations corresponding to SQL's ORDER BY, LIMIT, OUTER JOIN, GROUP BY and HAVING. We describe the type system and the normalization rules to produce the efficient SQL code. The type system not only ensures by construction the intricate SQL validity constraints. It also prevents the accidental composition of hard-to-optimize queries. Our extended QUEA is embedded in OCaml in the tagless-final style.",

keywords = "EDSL, Language-integrated query, LINQ, SQL, Tagless-final",

author = "Tatsuya Katsushima and Kiselyov, {Oleg Evgenievich}",

year = "2017",

month = jan,

day = "2",

doi = "10.1145/3018882.3018893",

language = "English",

pages = "123--124",

booktitle = "PEPM 2017 - Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, co-located with POPL 2017",

publisher = "Association for Computing Machinery, Inc",

note = "2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017 ; Conference date: 16-01-2017 Through 17-01-2017",

}

TY - GEN

T1 - Language-integrated query with ordering, grouping and outer joins

AU - Katsushima, Tatsuya

AU - Kiselyov, Oleg Evgenievich

PY - 2017/1/2

Y1 - 2017/1/2

N2 - Language-integrated query systems like T-LINQ or QUEA make relational operations on (generally external) data feel like the ordinary iteration over native arrays. As ordinary programs, queries are type-checked, can be abstracted over and composed. To access relational database systems, queries are eventually translated into well-formed, well-typed and efficient SQL. However, most existing language-integrated query systems implement only a small subset of relational operations supported by modern databases. To make QUEA full-featured, we add to it the operations corresponding to SQL's ORDER BY, LIMIT, OUTER JOIN, GROUP BY and HAVING. We describe the type system and the normalization rules to produce the efficient SQL code. The type system not only ensures by construction the intricate SQL validity constraints. It also prevents the accidental composition of hard-to-optimize queries. Our extended QUEA is embedded in OCaml in the tagless-final style.

AB - Language-integrated query systems like T-LINQ or QUEA make relational operations on (generally external) data feel like the ordinary iteration over native arrays. As ordinary programs, queries are type-checked, can be abstracted over and composed. To access relational database systems, queries are eventually translated into well-formed, well-typed and efficient SQL. However, most existing language-integrated query systems implement only a small subset of relational operations supported by modern databases. To make QUEA full-featured, we add to it the operations corresponding to SQL's ORDER BY, LIMIT, OUTER JOIN, GROUP BY and HAVING. We describe the type system and the normalization rules to produce the efficient SQL code. The type system not only ensures by construction the intricate SQL validity constraints. It also prevents the accidental composition of hard-to-optimize queries. Our extended QUEA is embedded in OCaml in the tagless-final style.

KW - EDSL

KW - Language-integrated query

KW - LINQ

KW - SQL

KW - Tagless-final

UR - http://www.scopus.com/inward/record.url?scp=85010440825&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010440825&partnerID=8YFLogxK

U2 - 10.1145/3018882.3018893

DO - 10.1145/3018882.3018893

M3 - Conference contribution

AN - SCOPUS:85010440825

SP - 123

EP - 124

BT - PEPM 2017 - Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, co-located with POPL 2017

PB - Association for Computing Machinery, Inc

T2 - 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2017

Y2 - 16 January 2017 through 17 January 2017

ER -

Language-integrated query with ordering, grouping and outer joins

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this