Efficient Execution of Range Top-k Queries in Aggregate R-Trees*This work was supported in part by the Brain Korea 21 Project and in part by the Ministry of Information & Communications, Korea, under the Information Technology Research Center (ITRC) Support Program in 2005.

  • Authors:

  • Seokjin Hong;Bongki Moon;Sukho Lee

  • Affiliations:

  • The authors are with the School of Computer Science, Seoul National University, Seoul, Korea. E-mail: jinny@db.snu.ac.kr,;The author is with the Department of Computer Science, University of Arizona, Tucson, AZ 85721, USA.;The authors are with the School of Computer Science, Seoul National University, Seoul, Korea. E-mail: jinny@db.snu.ac.kr,

  • Venue:
  • IEICE - Transactions on Information and Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A range top-k query returns the topmost k records in the order set by a measure attribute within a specified region of multi-dimensional 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.