Threshold Aggregate Query in Spatio-temporal Network Databases.
Panfeng Zhou, Jun Gong · Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research) · 2005
Abstract. Aggregate R-B-tree (aRB-tree) provides a framework for supporting OLAP operations over spatio-temporal data. Although existing aRB-tree implementations process sptio-temporal aggregate queries pretty efficiently, it is hardly applicable for online processing due to the excessive accesses to the aggregate B-trees of the entries in the R-tree and the overlap in the R-tree. This paper addresses these problems by proposing several techniques that completely avoid the overlap in the R-tree and significantly reduce the excessive accesses to the B-trees during the update. We further extended original aRB-tree to aRBB +-tree which can process the threshold aggregate queries more efficiently. 1.