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

Authors:
Yon Dohn Chung;Woo Suk Yang;Myoung Ho Kim
Affiliations:
Department of Computer Science and Engineering, Korea University, Anam-Dong, Seongbuk-Gu, Seoul, 136-713, South Korea;R&D Lab., ARA Network Technologies Co., Ltd., Gajeong-Dong, Yuseong-Gu, Daejon, 305-350, South Korea;Department of Computer Science, KAIST, Guseong-Dong, Yuseong-Gu, Daejeon, 305-701, South Korea
Venue:
Decision Support Systems
Year:
2007

Citing 11
Cited 1

An overview of data warehousing and OLAP technology

ACM SIGMOD Record
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
Finding an efficient rewriting of OLAP queries using materialized views in data warehouses

Decision Support Systems
Past, present, and future of decision support technology

Decision Support Systems - Special issue: Decision support systems: Directions for the next decade
The RD-Tree: a structure for processing partial-MAX/MIN Queries in OLAP

Information Sciences—Applications: An International Journal
Hierarchical Compact Cube for Range-Max Queries

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Adaptive Method for Range Top- k Queries in OLAP Data Cubes

DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Space-efficient cubes for OLAP range-sum queries

Decision Support Systems

A practical approach for efficiently answering top-k relational queries

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

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.