Persistent Functional Languages: Toward Functional Relational Databases

Lesley Wevers

doi:10.1145/2602622.2602627

Persistent Functional Languages: Toward Functional Relational Databases

Lesley Wevers

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

74 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 language	English
Title of host publication	SIGMOD/PODS'14
Subtitle of host publication	Proceedings of the 2014 SIGMOD PhD Symposium
Place of Publication	New York
Publisher	Association for Computing Machinery
Pages	21-25
Number of pages	5
ISBN (Print)	978-1-4503-2924-8
DOIs	https://doi.org/10.1145/2602622.2602627
Publication status	Published - 22 Jun 2014
Event	2014 SIGMOD PhD Symposium - Snowbird, United States Duration: 22 Jun 2014 → 22 Jun 2014

Conference

Conference	2014 SIGMOD PhD Symposium
Country/Territory	United States
City	Snowbird
Period	22/06/14 → 22/06/14

Keywords

CR-H.2.3
CR-H.2.4
CR-D.3.2
Memoization
Lazy evaluation
Online schema transformations
Concurrency control

Access to Document

10.1145/2602622.2602627

Cite this

@inproceedings{747d6fd9566c43a9bb732af16d645f2e,

title = "Persistent Functional Languages: Toward Functional Relational Databases",

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.",

keywords = "CR-H.2.3, CR-H.2.4, CR-D.3.2, Memoization, Lazy evaluation, Online schema transformations, Concurrency control",

author = "Lesley Wevers",

year = "2014",

month = jun,

day = "22",

doi = "10.1145/2602622.2602627",

language = "English",

isbn = "978-1-4503-2924-8",

pages = "21--25",

booktitle = "SIGMOD/PODS'14",

publisher = "Association for Computing Machinery",

address = "United States",

note = "2014 SIGMOD PhD Symposium ; Conference date: 22-06-2014 Through 22-06-2014",

}

TY - GEN

T1 - Persistent Functional Languages

T2 - 2014 SIGMOD PhD Symposium

AU - Wevers, Lesley

PY - 2014/6/22

Y1 - 2014/6/22

N2 - 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.

AB - 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.

KW - CR-H.2.3

KW - CR-H.2.4

KW - CR-D.3.2

KW - Memoization

KW - Lazy evaluation

KW - Online schema transformations

KW - Concurrency control

U2 - 10.1145/2602622.2602627

DO - 10.1145/2602622.2602627

M3 - Conference contribution

SN - 978-1-4503-2924-8

SP - 21

EP - 25

BT - SIGMOD/PODS'14

PB - Association for Computing Machinery

CY - New York

Y2 - 22 June 2014 through 22 June 2014

ER -

Persistent Functional Languages: Toward Functional Relational Databases

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this