A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases
2004
Distributed and parallel databases
The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and stringency of response time requirements has out-paced advancements in processor and mass storage technology, leading to the need for parallel temporal database management systems. In this paper, we introduce a variety of parallel temporal aggregation algorithms for the shared-nothing architecture; these algorithms are based on the sequential Aggregation Tree
doi:10.1023/b:dapd.0000028553.70337.e1
fatcat:6fkf7meuizfwzcvlsfokg7y57q