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

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. (c) 2006 Published by Elsevier B.V.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2007-03
Language
ENG
Citation

DECISION SUPPORT SYSTEMS, v.43, no.2, pp.313 - 321

ISSN
0167-9236
DOI
10.1016/j.dss.2006.10.001
URI
http://hdl.handle.net/10203/1977
Appears in Collection
CS-Journal Papers(저널논문)
  • Hit : 607
  • Download : 19
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 4 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0