Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

14th International Symposium on Temporal Representation and Reasoning (TIME'07)   pp. 35-46
SQTL: A Preliminary Proposal for a Temporal-to-Temporal Query Language

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2007.60
Send link to a friend

Abstract
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.
Additional Information
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

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback