Temporal support for persistent stored modules

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
Pages114-125
Number of pages12
DOIs
Publication statusPublished - 2012
EventIEEE 28th International Conference on Data Engineering, ICDE 2012 - Arlington, VA, United States
Duration: Apr 1 2012Apr 5 2012

Other

OtherIEEE 28th International Conference on Data Engineering, ICDE 2012
CountryUnited States
CityArlington, VA
Period4/1/124/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