|
Our work on Database-Supported Haskell (DSH), presented at the International Symposium on the Implementation and Application of Functional Languages (IFL 2010), has won the
Peter Landin Prize 2011.
The Peter Landin Prize is awarded to the best paper presented at the symposium each year, as selected by the program committee.
We are delighted and feel truly honored and would like to thank the IFL 2010 program committee for this recognition of our efforts to bring the FP and DB worlds even closer together.
DSH is available on Hackage.
DSH is a Haskell library for database-supported program execution. Using this library a relational database management system (RDBMS) can be used as a coprocessor for the Haskell programming language, especially for those program fragments that carry out data-intensive and data-parallel computation.
Database executable program fragments can be written using the list comprehension notation (with modest syntax changes due to quasiquoting) and list processing combinators from the Haskell list prelude. Note that rather than embedding a relational language into Haskell, we turn idiomatic Haskell programs into SQL queries.
DSH faithfully represents list order and nesting, and compiles the list processing combinators into relational queries. The implementation avoids unnecessary data transfer and context switching between the database coprocessor and the Haskell runtime by ensuring that the number of generated relational queries is only determined by the program fragment's type and not by the database size.
DSH can be used to allow existing Haskell programs to operate on large scale data (e.g., larger than the available heap) or query existing database resident data with Haskell.
|
