TSQL2 language specification

@article{Snodgrass1994TSQL2LS,
  title={TSQL2 language specification},
  author={Richard T. Snodgrass and Ilsoo Ahn and Gad Ariav and Don S. Batory and James Clifford and Curtis E. Dyreson and Ramez A. Elmasri and Fabio Grandi and Christian S. Jensen and Wolfgang K{\"a}fer and Nick Kline and Krishna G. Kulkarni and T. Y. Cliff Leung and Nikos A. Lorentzos and John F. Roddick and Arie Segev and Michael D. Soo and Suryanarayana M. Sripada},
  journal={SIGMOD Rec.},
  year={1994},
  volume={23},
  pages={65-86}
}
This docuinent specifies a temporal extension to the SQL-92 language standard. The language is designated TSQLZ. The document is organized as follows. The next section indicates the starting point of the design, the SQL92 language. Section 4 lists the desired features on which the TSQL2 Language Design Committee reached consensus. Section 5 presents the major concepts underlying TSQL2. Compatibility with SQL-92 is the topic of Section 6. Section 7 briefly discusses how the language can be… 

Figures and Tables from this paper

Timeline index: a unified data structure for processing queries on temporal data in SAP HANA
TLDR
The Timeline Index is developed as a novel, unified data structure that efficiently supports temporal operators such as temporal aggregation, time travel, and temporal joins and provides flexibility in physical design; e.g., it supports any kind of compression scheme, which is crucial for main memory column stores.
Benchmarking Databases with History Support
TLDR
A benchmark proposal which provides comprehensive coverage of the bitemporal data management, which builds on the solid foundations of TPC-H but extends it with a rich set of queries and update scenarios is presented.
Temporal Coalescing on Window Extents over Data Streams
TLDR
This paper distinguishes between eager coalescing and lazy coalescing, the two known coalescing schemes, and presents algorithms for updating a window extent for both tuple-based and time-based windows.
Processing temporal aggregates in parallel
  • X. Ye, J. Keane
  • Computer Science
    1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation
  • 1997
TLDR
Two approaches to parallelising an algorithm for computing temporal aggregates on an SGI PowerChallenge SMP parallel system are described and the experimental results show that the performance of the two approaches depends on data skew ratio and the number of processors used in the computation.
Delete operation in PostgreSQL for bitemporal tables
TLDR
A modification of the native PostgreSQL DELETE operation for bitemporal tables is proposed that allows it to be aligned with the corresponding operation of the SQL: 2011 standard.
Snapshot Semantics for Temporal Multiset Relations
TLDR
This work introduces a novel temporal data model based on K -relations that overcomes two bugs regarding snapshot aggregation and bag difference and proves it to correctly encode snapshot semantics.
Snapshot Semantics for Temporal Multiset Relations (Extended Version)
TLDR
This work introduces a novel temporal data model based on K-relations that overcomes two bugs regarding snapshot aggregation and bag difference and proves it to correctly encode snapshot semantics.
Sequenced Semantics for Temporal Multiset Relations (extended version)
TLDR
This paper proposes the first provably correct interval-based framework for sequenced semantics over temporal set and multiset relations which supports full relational algebra plus aggregation, and proposes a new logical model that represents temporal relations as K-relations, where each tuple is annotated with its complete history.
CME: a temporal relational model for efficient coalescing
TLDR
A novel temporal relational model through which coalescing becomes quite simple is presented, to augment each time-varying attribute in a temporal relation with two additional attributes that trace changes in values of the corresponding time-Varyingattribute.
Optimizing temporal queries: efficient handling of duplicates
  • Ivan T. Bowman, David Toman
  • Computer Science
    Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001
  • 2001
TLDR
This paper presents an optimization technique that produces more efficient translated SQL queries by taking into account the properties of the encoding used for temporal attributes, in the context of SQL/TP.
...
...

References

SHOWING 1-10 OF 11 REFERENCES
Acknowledgements
  • Experimental Gerontology
  • 1992
')) ALTER TABLE TABLES ADD COLUMN TRANSACTION-TIME CHARACTERDATA CONSTRAINT TRANSACTION_TIME-CHECK CHECK (TRANSACTION-TIME IN ('STATE', 'NONE'))
  • ')) ALTER TABLE TABLES ADD COLUMN TRANSACTION-TIME CHARACTERDATA CONSTRAINT TRANSACTION_TIME-CHECK CHECK (TRANSACTION-TIME IN ('STATE', 'NONE'))
If T was an event table and valid deenition speciies period, then the timestamp of each tuple in T is converted from a set of instants to a set of periods
  • If T was an event table and valid deenition speciies period, then the timestamp of each tuple in T is converted from a set of instants to a set of periods
For the add valid deenition, T shall be a snapshot or transaction-time table. 3. For the drop valid deenition, T shall be a valid-time or bitemporal table
  • For the add valid deenition, T shall be a snapshot or transaction-time table. 3. For the drop valid deenition, T shall be a valid-time or bitemporal table
If T is a transaction-time or bitemporal table, the transaction time of the appended or update tuple is PERIODTIMESTAMP CURRENT TIMESTAMP, NOBINDTIMESTAMP 'until changed
    7/l/1993) Figure 1: The time-line clock
    • 1993
    For scale valid deenition, the temporal element o f e a c h tuple of T is converted to the new precision and scale, using a cast or scale operation
    • For scale valid deenition, the temporal element o f e a c h tuple of T is converted to the new precision and scale, using a cast or scale operation
    Use of VALID denotes the temporal element timestamping of the underlying tuple, which m ust be associated with a valid time or bitemporal state table that has not been partitioned
      For the scale valid deenition, T shall be a valid-time or bitemporal table
      • For the scale valid deenition, T shall be a valid-time or bitemporal table
      Let T be the table identiied in the containing alter table statement
      • Let T be the table identiied in the containing alter table statement
      ...
      ...