SQL/LPP: A Time Series Extension of SQL Based on Limited Patience Patterns

Authors:
Chang-Shing Perng;Douglas Stott Parker, Jr.
Affiliations:
-;-
Venue:
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Year:
1999

Citing 5
Cited 1

Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The TSQL2 Temporal Query Language

The TSQL2 Temporal Query Language
SEQ: A Model for Sequence Databases

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Querying Shapes of Histories

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Time Series, A Neglected Issue in Temporal Database Research?

Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases

Relational languages and data models for continuous queries on sequences and data streams

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce SQL/LPP, a time series extension of SQL. SQL/LPP is based on Limited Patience Patterns, a temporal pattern model that is expressive, practical, intuitive, and supports a declarative algebraic syntax permitting query optimization. We illustrate basic features of SQL/LPP, showing the definition and use of popular time series patterns.