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

Woo Suk Yang; Yon Dohn Chung; Myoung Ho Kim

doi:10.1016/S0020-0255(02)00184-6

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 journal › Article › peer-review

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 language	English
Pages (from-to)	137-149
Number of pages	13
Journal	Information Sciences
Volume	146
Issue number	1-4
DOIs	https://doi.org/10.1016/S0020-0255(02)00184-6
Publication status	Published - 2002 Oct
Externally published	Yes

Keywords

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

Access to Document

10.1016/S0020-0255(02)00184-6

Cite this

@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}",

note = "Funding Information: This work was supported in part by grant No. R01-1999-00244 from the interdisciplinary research program of the KOSEF. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.",

year = "2002",

month = oct,

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

N1 - Funding Information: This work was supported in part by grant No. R01-1999-00244 from the interdisciplinary research program of the KOSEF. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.

PY - 2002/10

Y1 - 2002/10

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

SN - 0020-0255

VL - 146

SP - 137

EP - 149

JO - Information Sciences

JF - Information Sciences

IS - 1-4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this