DocumentCode
317997
Title
Processing temporal aggregates in parallel
Author
Ye, Xinfeng ; Keane, John A.
Author_Institution
Dept. of Comput. Sci., Auckland Univ., New Zealand
Volume
2
fYear
1997
fDate
12-15 Oct 1997
Firstpage
1373
Abstract
Temporal databases maintain past, present and future data. TSQL2 is a query language designed for temporal databases. In TSQL2, the GROUP BY clause has the temporal grouping property. In temporal grouping, the time line of each attribute value is partitioned into several sections, and aggregate functions are computed for each time partition. This paper describes two approaches to parallelising an algorithm for computing temporal aggregates. The two approaches have been implemented on an SGI PowerChallenge SMP parallel system. The experimental results show that the performance of the two approaches depends on data skew ratio and the number of processors used in the computation
Keywords
parallel algorithms; query processing; temporal databases; tree searching; SGI PowerChallenge parallel system; TSQL2 query language; group partition; parallel algorithm; temporal aggregate processing; temporal databases; temporal grouping; tree sharing; Aggregates; Concurrent computing; Database languages; Parallel algorithms; Relational databases; Tellurium; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on
Conference_Location
Orlando, FL
ISSN
1062-922X
Print_ISBN
0-7803-4053-1
Type
conf
DOI
10.1109/ICSMC.1997.638165
Filename
638165
Link To Document