An efficient, robust method for processing of partial top-k/bottom-k queries using the RD-Tree in online analytical processing (OLAP)

Online analytical processing (OLAP) is a widely used technology for facilitating decision support applications. In the paper, we consider partial aggregation queries, especially for partial top-k/bottom-k, which retrieve the top/bottom-k records among the specified cells of the given query. For the efficient processing of partial ranking queries, this paper proposes a set of algorithms using the RD-Tree, which is a data structure previously proposed for partial max/min queries. Through experiments with real data, we show the efficiency, robustness, and low storage overhead of the proposed method.