loading...
SQTL: A Preliminary Proposal for a Temporal-to-Temporal Query Language
Alicante, Spain June 28-June 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2007.6014th International Symposium on Tempo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nicole Bidoit, Univ. Paris-Sud, France
Matthieu Objois, Univ. Paris-Sud, France
A temporal database can be represented as a finite sequence of relational instances. Queries over such temporal instances usually map the input sequences to relation instances. Motivated by emerging applications, we are investigating a new type of queries over temporal instances, called t2t queries (temporal-to- temporal queries). The issue is to develop languages able to define mappings from temporal instances to temporal instances. The paper proposes and investigates two types of t2t query languages: point wise languages and SQTL languages.
Index Terms:
Temporal databases, temporal query languages.
Citation:
Nicole Bidoit, Matthieu Objois, "SQTL: A Preliminary Proposal for a Temporal-to-Temporal Query Language," time, pp.35-46, 14th International Symposium on Temporal Representation and Reasoning (TIME'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions