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

Yon Dohn Chung, Woo Suk Yang, Myoung Ho Kim

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)313-321
Number of pages9
JournalDecision Support Systems
Volume43
Issue number2
DOIs
Publication statusPublished - 2007 Mar 1

    Fingerprint

Keywords

  • Aggregation
  • Decision support applications
  • OLAP
  • Partial ranking queries
  • RD-Tree
  • Top-k/bottom-k

ASJC Scopus subject areas

  • Management Information Systems
  • Information Systems
  • Information Systems and Management

Cite this