Paper Info
Title
Temporal Query Languages Expressive Power: µTL versus T-WHILE
Abstract
We investigate the expressive power of implicit temporal query languages. The initial motivation was refining the results of [1] and enrich them with comparison to µTL [17]. Thus, we address two classes of temporal query languages: µTL-like languages based on TL and T-WHILE-like languages based on WHILE. We provide a two-level hierarchy (w.r.t. expressive power) for these temporal query languages. One of the contributions solves an open problem: the relative expressivity of µTL and T-FIXPOINT [1, 11].
Year
DOI
Venue
2005
10.1109/TIME.2005.35
TIME
Keywords
DocType
ISBN
implicit temporal query language,temporal query languages expressive,open problem,two-level hierarchy,initial motivation,t-while-like language,expressive power,temporal query language,relative expressivity,tl-like language,database languages,cost accounting,query languages,merging,logic,temporal databases
Conference
0-7695-2370-6
Citations 
PageRank 
References 
0
0.34
8
Authors
2
Name
Order
Citations
PageRank
Nicole Bidoit1642236.48
Matthieu Objois212.37