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 journalArticle

2 Citations (Scopus)

Abstract

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
Volume146
Issue number1-4
DOIs
Publication statusPublished - 2002 Oct 1
Externally publishedYes

Fingerprint

Online Analytical Processing
Decision trees
Decision tree
Query
Partial
Processing
Min-max
Cell
Decision Support
Range of data
Online analytical processing
Experiments
Experiment

Keywords

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

ASJC Scopus subject areas

  • Statistics and Probability
  • Electrical and Electronic Engineering
  • Statistics, Probability and Uncertainty
  • Information Systems and Management
  • Information Systems
  • Computer Science Applications
  • Artificial Intelligence

Cite this

The RD-Tree : A structure for processing Partial-MAX/MIN queries in OLAP. / Yang, Woo Suk; Chung, Yon Dohn; Kim, Myoung Ho.

In: Information Sciences, Vol. 146, No. 1-4, 01.10.2002, p. 137-149.

Research output: Contribution to journalArticle

Yang, Woo Suk ; Chung, Yon Dohn ; Kim, Myoung Ho. / The RD-Tree : A structure for processing Partial-MAX/MIN queries in OLAP. In: Information Sciences. 2002 ; Vol. 146, No. 1-4. pp. 137-149.
@article{1a93dee928454418a9b40ed6f181abfe,
title = "The RD-Tree: A structure for processing Partial-MAX/MIN queries in OLAP",
abstract = "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.",
keywords = "Databases, OLAP, Partial-max/min query, Query processing",
author = "Yang, {Woo Suk} and Chung, {Yon Dohn} and Kim, {Myoung Ho}",
year = "2002",
month = "10",
day = "1",
doi = "10.1016/S0020-0255(02)00184-6",
language = "English",
volume = "146",
pages = "137--149",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "1-4",

}

TY - JOUR

T1 - The RD-Tree

T2 - A structure for processing Partial-MAX/MIN queries in OLAP

AU - Yang, Woo Suk

AU - Chung, Yon Dohn

AU - Kim, Myoung Ho

PY - 2002/10/1

Y1 - 2002/10/1

N2 - 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.

AB - 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.

KW - Databases

KW - OLAP

KW - Partial-max/min query

KW - Query processing

UR - http://www.scopus.com/inward/record.url?scp=0036799469&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036799469&partnerID=8YFLogxK

U2 - 10.1016/S0020-0255(02)00184-6

DO - 10.1016/S0020-0255(02)00184-6

M3 - Article

AN - SCOPUS:0036799469

VL - 146

SP - 137

EP - 149

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1-4

ER -