Temporal support for persistent stored modules

Richard T. Snodgrass; Dengfeng Gao; Rui Zhang; Stephen W. Thomas

doi:10.1109/ICDE.2012.70

Temporal support for persistent stored modules

Richard T. Snodgrass, Dengfeng Gao, Rui Zhang, Stephen W. Thomas

Computer Science

Research output: Contribution to journal › Conference article › peer-review

4 Scopus citations

Abstract

We show how to extend temporal support of SQL to the Turing-complete portion of SQL, that of persistent stored modules (PSM). Our approach requires minor new syntax beyond that already in SQL/Temporal to define and to invoke PSM routines, thereby extending the current, sequenced, and non-sequenced semantics of queries to PSM routines. Temporal upward compatibility (existing applications work as before when one or more tables are rendered temporal) is ensured. We provide a transformation that converts Temporal SQL/PSM to conventional SQL/PSM. To support sequenced evaluation of PSM routines, we define two different slicing approaches, maximal slicing and per-statement slicing. We compare these approaches empirically using a comprehensive benchmark and provide a heuristic for choosing between them.

Original language	English (US)
Article number	6228077
Pages (from-to)	114-125
Number of pages	12
Journal	Proceedings - International Conference on Data Engineering
DOIs	https://doi.org/10.1109/ICDE.2012.70
State	Published - Jul 30 2012
Event	IEEE 28th International Conference on Data Engineering, ICDE 2012 - Arlington, VA, United States Duration: Apr 1 2012 → Apr 5 2012

ASJC Scopus subject areas

Software
Signal Processing
Information Systems

Access to Document

10.1109/ICDE.2012.70

Fingerprint Dive into the research topics of 'Temporal support for persistent stored modules'. Together they form a unique fingerprint.

Cite this

@article{15b9c0ec66d142b58947cec563234c91,

title = "Temporal support for persistent stored modules",

abstract = "We show how to extend temporal support of SQL to the Turing-complete portion of SQL, that of persistent stored modules (PSM). Our approach requires minor new syntax beyond that already in SQL/Temporal to define and to invoke PSM routines, thereby extending the current, sequenced, and non-sequenced semantics of queries to PSM routines. Temporal upward compatibility (existing applications work as before when one or more tables are rendered temporal) is ensured. We provide a transformation that converts Temporal SQL/PSM to conventional SQL/PSM. To support sequenced evaluation of PSM routines, we define two different slicing approaches, maximal slicing and per-statement slicing. We compare these approaches empirically using a comprehensive benchmark and provide a heuristic for choosing between them.",

author = "Snodgrass, {Richard T.} and Dengfeng Gao and Rui Zhang and Thomas, {Stephen W.}",

year = "2012",

month = jul,

day = "30",

doi = "10.1109/ICDE.2012.70",

language = "English (US)",

pages = "114--125",

journal = "Proceedings - International Conference on Data Engineering",

issn = "1084-4627",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "IEEE 28th International Conference on Data Engineering, ICDE 2012 ; Conference date: 01-04-2012 Through 05-04-2012",

}

TY - JOUR

T1 - Temporal support for persistent stored modules

AU - Snodgrass, Richard T.

AU - Gao, Dengfeng

AU - Zhang, Rui

AU - Thomas, Stephen W.

PY - 2012/7/30

Y1 - 2012/7/30

N2 - We show how to extend temporal support of SQL to the Turing-complete portion of SQL, that of persistent stored modules (PSM). Our approach requires minor new syntax beyond that already in SQL/Temporal to define and to invoke PSM routines, thereby extending the current, sequenced, and non-sequenced semantics of queries to PSM routines. Temporal upward compatibility (existing applications work as before when one or more tables are rendered temporal) is ensured. We provide a transformation that converts Temporal SQL/PSM to conventional SQL/PSM. To support sequenced evaluation of PSM routines, we define two different slicing approaches, maximal slicing and per-statement slicing. We compare these approaches empirically using a comprehensive benchmark and provide a heuristic for choosing between them.

AB - We show how to extend temporal support of SQL to the Turing-complete portion of SQL, that of persistent stored modules (PSM). Our approach requires minor new syntax beyond that already in SQL/Temporal to define and to invoke PSM routines, thereby extending the current, sequenced, and non-sequenced semantics of queries to PSM routines. Temporal upward compatibility (existing applications work as before when one or more tables are rendered temporal) is ensured. We provide a transformation that converts Temporal SQL/PSM to conventional SQL/PSM. To support sequenced evaluation of PSM routines, we define two different slicing approaches, maximal slicing and per-statement slicing. We compare these approaches empirically using a comprehensive benchmark and provide a heuristic for choosing between them.

UR - http://www.scopus.com/inward/record.url?scp=84864271271&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864271271&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2012.70

DO - 10.1109/ICDE.2012.70

M3 - Conference article

AN - SCOPUS:84864271271

SP - 114

EP - 125

JO - Proceedings - International Conference on Data Engineering

JF - Proceedings - International Conference on Data Engineering

SN - 1084-4627

M1 - 6228077

T2 - IEEE 28th International Conference on Data Engineering, ICDE 2012

Y2 - 1 April 2012 through 5 April 2012

ER -