The RD-Tree: a structure for processing partial-MAX/MIN Queries in OLAP

Authors:
Woo Suk Yang;Yon Dohn Chung;Myoung Ho Kim
Affiliations:
Division of Computer Science, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1, KuSung-Dong, YuSung-Gu, Taejon, 305-701, ...;Division of Computer Science, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1, KuSung-Dong, YuSung-Gu, Taejon, 305-701, ...;Division of Computer Science, Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 373-1, KuSung-Dong, YuSung-Gu, Taejon, 305-701, ...
Venue:
Information Sciences—Applications: An International Journal
Year:
2002

Citing 4
Cited 2

Improved query performance with variant indexes

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Range queries in OLAP data cubes

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Partial-sum queries in OLAP data cubes using covering codes

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An efficient processing of range-MIN/MAX queries over data cube

Information Sciences: an International Journal

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

Decision Support Systems
Spatial indexing for scalability in FCA

ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

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