Efficient execution of range top-k queries in aggregate R-trees

被引:5
|
作者
Hong, SJ [1 ]
Moon, B
Lee, S
机构
[1] Seoul Natl Univ, Sch Comp Sci, Seoul, South Korea
[2] Univ Arizona, Dept Comp Sci, Tucson, AZ 85721 USA
来源
关键词
spatial database; data warehouse; range top-k query; aggregate R-tree;
D O I
10.1093/ietisy/e88-d.11.2544
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2544 / 2554
页数:11
相关论文
共 50 条
  • [21] Efficient All Top-k Computation-A Unified Solution for All Top-k, Reverse Top-k and Top-m Influential Queries
    Ge, Shen
    U, Leong Hou
    Mamoulis, Nikos
    Cheung, David W.
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013, 25 (05) : 1015 - 1027
  • [22] Performance of nearest neighbor queries in R-trees
    Papadopoulos, A
    Manolopoulos, Y
    DATABASE THEORY - ICDT'97, 1997, 1186 : 394 - 408
  • [23] THE FARTHEST NEIGHBOR QUERIES BASED ON R-TREES
    Liu, Run-Tao
    Chang, Cheng
    Man, Zhi-Qiang
    Wang, Zhong
    PROCEEDINGS OF 2015 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOL. 1, 2015, : 235 - 238
  • [24] Efficient Approach to Top-k Dominating Queries on Service Selection
    Zhang, Jinfang
    Zhong, Farong
    Yang, Zhenguo
    2013 6TH JOINT IFIP WIRELESS AND MOBILE NETWORKING CONFERENCE (WMNC 2013), 2013,
  • [25] Efficient Authentication of Multi-Dimentional Top-k Queries
    Zhu, Xiaoyu
    Wu, Jie
    Chang, Wei
    Wang, Guojun
    Liu, Qin
    IEEE ACCESS, 2019, 7 : 4748 - 4762
  • [26] Efficient processing of top-k frequent spatial keyword queries
    Xu, Tao
    Xu, Aopeng
    Mango, Joseph
    Liu, Pengfei
    Ma, Xiaqing
    Zhang, Lei
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [27] Efficient processing of top-k dominating queries in distributed environments
    Daichi Amagata
    Yuya Sasaki
    Takahiro Hara
    Shojiro Nishio
    World Wide Web, 2016, 19 : 545 - 577
  • [28] Efficient processing of top-k queries: selective NRA algorithms
    Yuan, Jing
    Sun, Guangzhong
    Luo, Tao
    Lian, Defu
    Chen, Guoliang
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 39 (03) : 687 - 710
  • [29] An efficient algorithm for top-k queries on uncertain data streams
    Dai, Caiyan
    Chen, Ling
    Chen, Yixin
    Tang, Keming
    2012 11TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2012), VOL 1, 2012, : 294 - 299
  • [30] Efficient processing of top-k dominating queries in distributed environments
    Amagata, Daichi
    Sasaki, Yuya
    Hara, Takahiro
    Nishio, Shojiro
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2016, 19 (04): : 545 - 577