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

Yon Dohn Chung; Woo Suk Yang; Myoung Ho Kim

doi:10.1016/j.dss.2006.10.001

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

Yon Dohn Chung, Woo Suk Yang, Myoung Ho Kim

Department of Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

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.

Original language	English
Pages (from-to)	313-321
Number of pages	9
Journal	Decision Support Systems
Volume	43
Issue number	2
DOIs	https://doi.org/10.1016/j.dss.2006.10.001
Publication status	Published - 2007 Mar

Keywords

Aggregation
Decision support applications
OLAP
Partial ranking queries
RD-Tree
Top-k/bottom-k

ASJC Scopus subject areas

Management Information Systems
Information Systems
Developmental and Educational Psychology
Arts and Humanities (miscellaneous)
Information Systems and Management

Access to Document

10.1016/j.dss.2006.10.001

Cite this

@article{076ff0a6cc034353adc6c92c4a822d62,

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

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.",

keywords = "Aggregation, Decision support applications, OLAP, Partial ranking queries, RD-Tree, Top-k/bottom-k",

author = "Chung, {Yon Dohn} and Yang, {Woo Suk} and Kim, {Myoung Ho}",

note = "Funding Information: This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-D00463). ",

year = "2007",

month = mar,

doi = "10.1016/j.dss.2006.10.001",

language = "English",

volume = "43",

pages = "313--321",

journal = "Decision Support Systems",

issn = "0167-9236",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

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

AU - Chung, Yon Dohn

AU - Yang, Woo Suk

AU - Kim, Myoung Ho

N1 - Funding Information: This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-D00463).

PY - 2007/3

Y1 - 2007/3

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

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

KW - Aggregation

KW - Decision support applications

KW - OLAP

KW - Partial ranking queries

KW - RD-Tree

KW - Top-k/bottom-k

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

U2 - 10.1016/j.dss.2006.10.001

DO - 10.1016/j.dss.2006.10.001

M3 - Article

AN - SCOPUS:33846850557

SN - 0167-9236

VL - 43

SP - 313

EP - 321

JO - Decision Support Systems

JF - Decision Support Systems

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this