Generic multiset programming with discrimination-based joins and symbolic Cartesian products

DOI10.1007/s10990-011-9078-8zbMath1232.68028OpenAlexW2118384863MaRDI QIDQ656874

Ken Friis Larsen, Fritz Henglein

Publication date: 13 January 2012

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-011-9078-8

zbMATH Keywords

orderingSQLHaskelldiscriminationmultisetquerybaggeneric programmingGADTLINQprojectrelationalselect

Mathematics Subject Classification ID

Database theory (68P15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (4)

Comprehending Ringads ⋮ Iterating on multiple collections in synchrony ⋮ Generic multiset programming with discrimination-based joins and symbolic Cartesian products ⋮ Generic top-down discrimination for sorting and partitioning in linear time

Uses Software

• MapReduce
• Haskell
• GHC
• criterion
• MySQL
• Kleisli
• Links

Cites Work

• Unnamed Item
• Unnamed Item
• Generic multiset programming with discrimination-based joins and symbolic Cartesian products
• Principles of programming with complex objects and collection types
• An algorithm for handling many relational calculus queries efficiently.
• Applications of range query theory to relational data base join and selection operations
• Adaptive Query Processing
• Guarded recursive datatype constructors
• Comprehending monads
• Generic discrimination
• Generic top-down discrimination for sorting and partitioning in linear time

This page was built for publication: Generic multiset programming with discrimination-based joins and symbolic Cartesian products