Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3018882.3018893acmconferencesArticle/Chapter ViewAbstractPublication PagespepmConference Proceedingsconference-collections
abstract

Language-integrated query with ordering, grouping and outer joins (poster paper)

Published: 02 January 2017 Publication History
  • Get Citation Alerts
  • Abstract

    Language-integrated query systems like T-LINQ or QUEΛ 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 QUEΛ 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 QUEΛ is embedded in OCaml in the tagless-final style.

    References

    [1]
    J. Cheney, S. Lindley, and P. Wadler. A practical theory of languageintegrated query. In ICFP ’13, pages 403–416, New York, NY, USA, 2013. ACM.
    [2]
    E. Cooper. The script-writer’s dream: How to write great sql in your own language, and be sure it will succeed. In DBPL ’09, pages 36–51, Berlin, Heidelberg, 2009. Springer-Verlag.
    [3]
    T. Ellis. Opaleye. https://github.com/tomjaguarpaw/ haskell-opaleye. last visited: Dec. 2014.
    [4]
    K. Hibino, S. Murayama, S. Yasutake, S. Kuroda, and K. Yamamoto. Haskell relational record. http://khibino.github.io/ haskell-relational-record/. last visited: Jun. 2015.
    [5]
    K. Suzuki, O. Kiselyov, and Y. Kameyama. Finally, safely-extensible and efficient language-integrated query. In Proc. PEPM, pages 37–48. ACM, 2016.

    Cited By

    View all

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PEPM 2017: Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
    January 2017
    124 pages
    ISBN:9781450347211
    DOI:10.1145/3018882
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 02 January 2017

    Check for updates

    Author Tags

    1. EDSL
    2. LINQ
    3. SQL
    4. language-integrated query
    5. tagless-final

    Qualifiers

    • Abstract

    Funding Sources

    • JSPS KAKENHI

    Conference

    POPL '17
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 66 of 120 submissions, 55%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)0

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media