Persistent Functional Languages: Toward Functional Relational Databases

L. Wevers

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

19 Downloads (Pure)

Abstract

Functional languages provide new approaches to concurrency control, based on techniques such as lazy evaluation and memoization. We have designed and implemented a persistent functional language based on these ideas, which we plan to use for the implementation of a relational database system. With such a database system, we aim to show that lazy evaluation can be used to perform online schema transformations. Additionally, our persistent language allows database programs to be written as stored transactions, a mechanism similar to stored procedures. At a later stage, we want to leverage existing verification tools for the automatic verification of postconditions over these functional transactions.
Original languageUndefined
Title of host publicationProceedings of the 2014 SIGMOD PhD Symposium
Place of PublicationNew York
PublisherAssociation for Computing Machinery (ACM)
Pages21-25
Number of pages5
ISBN (Print)978-1-4503-2924-8
DOIs
Publication statusPublished - 22 Jun 2014
Event2014 SIGMOD PhD Symposium - Snowbird, UT, USA
Duration: 22 Jun 201422 Jun 2014

Publication series

Name
PublisherACM

Conference

Conference2014 SIGMOD PhD Symposium
Period22/06/1422/06/14
Other22 June 2014

Keywords

  • EWI-25768
  • CR-H.2.3
  • CR-H.2.4
  • CR-D.3.2
  • METIS-309916
  • Memoization
  • Lazy Evaluation
  • Online Schema Transformation
  • IR-94672
  • Concurrency Control

Cite this