Browse > Article

Efficient Execution of Range $Top-\kappa$ Queries using a Hierarchical Max R-Tree  

홍석진 (서울대학교 전기컴퓨터공학부)
이상준 (서울대학교 전기컴퓨터공학)
이석호 (서울대학교 전기컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.31, no.2, 2004 , pp. 132-139 More about this Journal
Abstract
A range $Top-\kappa$ query returns top k records in order of a measure attribute within a specified region on multi-dimensional data, and it is a powerful tool for analysis in spatial databases and data warehouse environments. In this paper, we propose an algorithm for answering the query via selective traverse of a Hierarchical Max R-Tree(HMR-tree). It is possible to execute the query by accessing only a small part of the leaf nodes in the query region, and the query performance is nearly constant regardless of the size of the query region. The algorithm manages the priority queue efficiently to reduce cost of handling the queue and the proposed HMR-tree can guarantee the same fan-out as the original R-tree.
Keywords
Range$Top-\kappa$ Query; Hierarchical Max R-Tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Surajit Chaudhuri, Umeshwar Dayal, 'An Overview of Data Warehousing and OLAP Technology,' SIGMOD Record vol.26, No.1, pp.65-74, 1997   DOI   ScienceOn
2 Antonin Guttman: R-Trees, 'A Dynamic Index Structure for Spatial Searching,' SIGMOD Conference, pp.47-57, 1984   DOI
3 Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger, 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,' SIGMOD Conference, pp.322-331, 1990
4 Ralf Hartmut Guting, 'An Introduction to Spatial Database Systems,' VLDB Journal, vol.3, No.4, pp.357-399, 1994   DOI
5 J. Gray, A. Bosworth, A. Layman, and H. Piramish, 'Data Cube: A Relational Aggregation Operator Generalizing, Group-By, Crosstab, and Sub-Totals,' Int. Conference on Data Engineering, pp.152-159, 1996
6 Venky Harinarayan, Anand Rajaraman, Jeffrey D.Ullman, 'Implementing Data Cubes Efficiently,' SIGMOD Conference, pp.205-216, 1996   DOI   ScienceOn
7 Chee Yong Chen, Yannis E. Ioannidis, 'Hierarchical Prefix Cubes for Range-Sum Queries,' VLDB, pp.675-686, 1999
8 Steven Geffner, Divyakant Agrawal, Amr El Abbadi, Terence R.Smith, 'Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes,' Int. Conference on Data Engineering, pp. 328-335, 1999
9 Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li, 'Hierarchical Compact Cube for Range-Max Queries,' VLDB, pp.232-241, 2000
10 Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant, 'Range Queries in OLAP Data Cubes,' SIGMOD Conference, pp.73-88, 1997   DOI   ScienceOn
11 Seokjin Hong;Byoungho Song;Sekho Lee, 'Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments,' ER, pp.299-310, 2001
12 TPC-H, http://www.tpc.org/tpch, 2003
13 Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Lyong Lee, 'Dynamic Update Cube for Range-sum Queries,' VLDB, pp.521-530, 2001
14 Iosif Lazaridis, Sharad Mehrotra, 'Progressive Approximate Aggregate Queries with a Multi-Resolution Tree-Structure,' SIGMOD Conference, 2001   DOI   ScienceOn
15 U.S.Census Bureau - TIGER/LINE, http://www.census.gov/geo/www/tiger, 2003