Efficient Execution of Range Top-k Queries in Aggregate R-Trees(Database)

概要

論文の詳細を見る
A range top-k query returns the topmost k records in the order set by a measure attribute within a specified region of multidimensional data. The range top-k query is a powerful tool for analysis in spatial databases and data warehouse environments. In this paper, we propose an algorithm to answer the query by selectively traversing an aggregate R-tree having MAX as the aggregate values. The algorithm can execute the query by accessing only a small part of the leaf nodes within a query region. Therefore, it shows good query performance regardless of the size of the query region. We suggest an efficient pruning technique for the priority queue, which reduces the cost of handling the priority queue, and also propose an efficient technique for leaf node organization to reduce the number of node accesses to execute the range top-k queries.
社団法人電子情報通信学会の論文
2005-11-01