Temporal support for persistent stored modules

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

doi:10.1109/ICDE.2012.70

Temporal support for persistent stored modules

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

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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)
Title of host publication	Proceedings - International Conference on Data Engineering
Pages	114-125
Number of pages	12
DOIs	https://doi.org/10.1109/ICDE.2012.70
Publication status	Published - 2012
Event	IEEE 28th International Conference on Data Engineering, ICDE 2012 - Arlington, VA, United States Duration: Apr 1 2012 → Apr 5 2012

Other

Other	IEEE 28th International Conference on Data Engineering, ICDE 2012
Country	United States
City	Arlington, VA
Period	4/1/12 → 4/5/12

Fingerprint

ASJC Scopus subject areas

Information Systems
Signal Processing
Software

Cite this

Snodgrass, R. T., Gao, D., Zhang, R., & Thomas, S. W. (2012). Temporal support for persistent stored modules. In Proceedings - International Conference on Data Engineering (pp. 114-125). [6228077] https://doi.org/10.1109/ICDE.2012.70

@inproceedings{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 Thomas} and Dengfeng Gao and Rui Zhang and Thomas, {Stephen W.}",

year = "2012",

doi = "10.1109/ICDE.2012.70",

language = "English (US)",

pages = "114--125",

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

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

}

TY - GEN

T1 - Temporal support for persistent stored modules

AU - Snodgrass, Richard Thomas

AU - Gao, Dengfeng

AU - Zhang, Rui

AU - Thomas, Stephen W.

PY - 2012

Y1 - 2012

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 contribution

AN - SCOPUS:84864271271

SP - 114

EP - 125

BT - Proceedings - International Conference on Data Engineering

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

Y2 - 1 April 2012 through 5 April 2012

ER -

Access to Document

10.1109/ICDE.2012.70