The RD-Tree: a structure for processing Partial-MAX/MIN queries in OLAP
| Autor: | Yon Dohn Chung, Myoung Ho Kim, Woo Suk Yang |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Decision support system
Information Systems and Management Theoretical computer science Computer science Online analytical processing InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL Rank (computer programming) Aggregate (data warehouse) Decision tree computer.software_genre Class (biology) Computer Science Applications Theoretical Computer Science Tree (data structure) Range (mathematics) Artificial Intelligence Control and Systems Engineering Data mining computer Software |
| Zdroj: | Information Sciences. 146:137-149 |
| ISSN: | 0020-0255 |
| DOI: | 10.1016/s0020-0255(02)00184-6 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect