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