D. Pfoser and C. S. Jensen. Incremental Join of TimeOriented Data. TimeCenter Technical Report TR-34, Aalborg University, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Inga Sitzmann Peter Stuckey - Department Of Computer (2000) (Correct)
....is used by the algorithm during the join process. Temporal joins are categorised in [GS91] Different join algorithms, taking physical organisation and indexing of the data into account, are presented and their cost analysed. A sort merge based algorithm for time oriented data is presented in [PJ99]. An incremental approach is used to minimize the cost for updating temporal joins in append only databases. In [RF93] several refinements of the temporal nested loop join are proposed that minimize comparisons and buffer space required to reduce disk I O. A partition based temporal join is ....
....to reduce disk I O. A partition based temporal join is presented in [SSJ94] Sampling is used to approximate the distribution of 1 Join Additional Information Techniques Used Algorithm Sorting Sampling Index Histogram Append only Parallel Class database processing (sort) merge [GS91] GS91] [PJ99] [SS99] SS99] nested loop [RF93] partition based [SSJ94] SE96] this paper [LM92] Table 1: Classification of previous work on temporal joins the data and to compute the partitioning. The Time Index is used in [SE96] for a temporal join. The Time Index stores temporal entities depending on ....
Dieter Pfoser and Christian S. Jensen. Incremental join of time-oriented data. In Proc. of the 11th SSDBM, pages 232--243, 1999.
Improving Temporal Joins Using Histograms - Sitzmann, Stuckey (2000) (3 citations) (Correct)
....for the overall performance of the system. Several temporal join algorithms have been presented in the literature. Temporal joins are categorised in [GS91] taking the physical organisation and indexing of the data into account. A sort merge based algorithm for time oriented data is presented in [PJ99]. An incremental approach is used to minimize the cost for updating temporal joins in append only databases. In [RF93] several re nements of the temporal nested loop join are proposed that minimize comparisons and bu er space required to reduce disk I O. A partition based temporal join is ....
Dieter Pfoser and Christian S. Jensen. Incremental join of time-oriented data. In Proc. of the 11th SSDBM, pages 232-243, 1999.
Incremental Join of Time-Oriented Data - Dieter Pfoser Christian (1999) (3 citations) Self-citation (Pfoser Jensen) (Correct)
No context found.
D. Pfoser and C. S. Jensen. Incremental Join of TimeOriented Data. TimeCenter Technical Report TR-34, Aalborg University, 1998.
Join Operations in Temporal Databases - Gao, Jensen, Snodgrass, Soo Self-citation (Pfoser Jensen) (Correct)
....assumed the input relations were sorted by the start time and or end time, those algorithms are more like the second phase of sort mergebased timestamp algorithms. The algorithms are very similar to the sort merge based algorithms developed by Segev and Gunadhi. Most recently, Pfoser and Jensen [Pfo99] applied the sort merge approach to the temporal theta join in a setting where each argument relation consists of a non current and a current partition. Tuples in the former all have intervals that end before the current time, while all tuples of the latter have intervals that end at the current ....
....should be considered. In particular, we expect specialized temporal database architectures to have a significant impact on query processing efficiency. It has been argued in previous work that incremental query evaluation is especially appropriate for temporal databases [McK88, JMR91, Pfo99] In this approach, a query result is materialized and stored back into the database, if it is anticipated that the same query, or one similar to it, will be issued in the future. Updates to the contributing relations trigger corresponding updates to the stored result. The related topic of global ....
D. Pfoser and C. S. Jensen. Incremental Join of Time-Oriented Data. In Proceedings of the International Conference on Scientific and Statistical Database Management, pages 232--243, 1999.
Indexing Problems in Spatiotemporal Databases - Kollios (2000) (Correct)
No context found.
D. Pfoser, C.S. Jensen. Incremental Join of Time-Oriented Data. In Proc. 11th Intl. Conf. on SSDM, Cleveland, Ohio, July 28-30, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC