The RD-Tree: A structure for processing Partial-MAX/MIN queries in OLAP

Woo Suk Yang, Yon Dohn Chung, Myoung Ho Kim

Research output: Contribution to journalArticlepeer-review


Online analytical processing (OLAP) systems have been introduced to facilitate decision support applications. While most previous studies deal with the situation where the aggregate functions are applied to all cells in a given range, this paper considers a class of queries, called the Partial-MAX/MIN query, that are applied only to specified cells in a given range. We propose the Rank Index and Rank Decision Tree (RD-Tree) for efficient processing of the partial-max/min queries. Through experiments, we show our approach has an efficient and robust processing capability for partial-max/min queries.

Original languageEnglish
Pages (from-to)137-149
Number of pages13
JournalInformation Sciences
Issue number1-4
Publication statusPublished - 2002 Oct
Externally publishedYes


  • Databases
  • OLAP
  • Partial-max/min query
  • Query processing

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence


Dive into the research topics of 'The RD-Tree: A structure for processing Partial-MAX/MIN queries in OLAP'. Together they form a unique fingerprint.

Cite this