The RD-Tree: a structure for processing Partial-MAX/MIN queries in OLAP
نویسندگان
چکیده
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-MAX/MIN 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. 2002 Elsevier Science Inc. All rights reserved.
منابع مشابه
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 th...
متن کاملA Method for Partial Top-k/Bottom-k Queries in On-line Analytical Processing
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 top/bottom k records among the specified cells of the given query. For efficient processing of partial ranking queries, this paper proposes a set of algorithms using the RD-Tree...
متن کاملADenTS: An Adaptive Density-Based Tree Structure for Approximating Aggregate Queries over Real Attributes
In many fields and applications, it is critical for users to make decisions through OLAP queries. How to promote accuracy and efficiency while answering multiple aggregate queries, e.g. COUNT, SUM, AVG, MAX, MIN and MEDIAN? It has been the urgent problem in the fields of OLAP and data summarization recently. There have been a few solutions such as MRA-Tree and GENHIST for it. However, they coul...
متن کاملارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملEfficient evaluation of partially-dimensional range queries in large OLAP datasets
In light of the increasing requirement for processing multidimensional queries on OLAP (relational) data, the database community has focused on the queries (especially range queries) on the large OLAP datasets from the view of multidimensional data. It is well-known that multidimensional indices are helpful to improve the performance of such queries. However, we found that much information irre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 146 شماره
صفحات -
تاریخ انتشار 2002