|
|
|
     |
                                     |
Return to Temporal Queries
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced offline and stored since coalescing is an expensive operation. But the temporal extent of a tuple with now, times at different granularities, or incomplete times cannot be determined until query evaluation. This paper presents a strategy to partially coalesce temporal extents by identifying regions that are potentially covered. The covered regions can be used to evaluate temporal predicates and constructors on the coalesced extent. Our strategy uses standard relational database technology. We quantify the cost using the Oracle DBMS.
@inproceedings {DBLP:conf/sigmod/Dyreson03, author = {Curtis E. Dyreson}, booktitle = {SIGMOD Conference}, title = {Temporal Coalescing with Now, Granularity, and Incomplete Information.}, pages = {169-180}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#Dyreson03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r07p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
