Browse > Article

Efficient Execution of Range Mosaic Queries  

Hong, Seok-Jin (서울대학교 컴퓨터공학과)
Bae, Jin-Uk (서울대학교 컴퓨터공학과)
Lee, Suk-Ho (서울대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.32, no.5, 2005 , pp. 487-497 More about this Journal
Abstract
A range mosaic query returns distribution of data within the query region as a pattern of mosaic, whereas a range aggregate query returns a single aggregate value of data within the query region. The range mosaic query divides a query region by a multi-dimensional grid, and calculates aggregate values of grid cells. In this paper, we propose a new type of query, range mosaic query and a new operator, mosaic-by, with which the range mosaic queries can be represented. In addition, we suggest efficient algorithms for processing range mosaic queries using an aggregate R-tree. The algorithm that we present computes aggregate results of every mosaic grid cell by one time traversal of the aggregate R-tree, and efficiently executes the queries with only a small number of node accesses by using the aggregate values of the aggregate R-tree. Our experimental study shows that the range mosaic query algorithm is reliable in terms of performance for several synthetic datasets and a real-world dataset.
Keywords
range mosaic query; mosaic-by; aggregate R-tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Berchtold, C. Bohm, and H.P. Kriegel, 'The pyramid-technique: Towards breaking the curse of dimensionality,' Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA, ed. L.M. Haas and A. Tiwary, pp.142.153, ACM Press, 1998   DOI
2 TPC-H. http://www.tpc.org/tpch/, 2004
3 TIGER/Line. http://www.census.gov/geo/www/tiger/, 2002
4 J.Gray, A.Bosworth, A.Layman, H.Pitamish, Data Cube : A Relational Aggregatioon Operator Generalizing Group-By, Cross-Tab, and Sub-Totals, In Proc. of ICDE, pp. 152-159, 1996   DOI
5 A. Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' In Proceedings of ACM SIGMOD International Conference on Management of Data, pp.47-57, Jun., 1984   DOI
6 Zheng Xuan Loh, Tok Wang Ling, Chuan-Heng Ang, and Sin Yeung Lee, 'Adaptive method for range top-k queries in OLAP data cubes,' DEXA'02, pp.648-657. Springer, 2002
7 Seokjin Hong, Bongki Moon, and Sukho Lee, 'Processing range top-k queries in a sparse data cube,' Proceedings of the International Conference on Information and Knowledge Engineering. CSREA Press, 2004
8 Dimitris Papadias, Panos Kalnis, Jun Zhang, and Yufei Tao, 'Efficient OLAP operations in spatial data warehouses,' In Advances in Spatial and Temporal Databases : 7th International Symposium, SSTD 2001, Redondo Beach, CA, USA, July 12-15, 2001, Proceedings, pp.443-459. Springer, 2001
9 Cbing-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, and Ramakrishnan Srikant, 'Range queries in OLAP data cubes,' Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA, pp.73-88. ACM Press, 1997
10 Seokjin Hong, Byoungho Song, and Sukho Lee, 'Efficient execution of range aggregate queries in data warehouse environments,' Conceptual Modeling-ER 2001: 20th International Conference on Conceptual Modeling, Yokohama, Japan, pp.299-310. Springer, 2001
11 I. Lazaridis and S. Mehrotra: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 401-412, 2001   DOI
12 Surajit Chaudhuri and Umeshwar Dayal, 'An Overview of Data Warehousing and OLAP technology,' ACM SIGMOD Record, 26(1):65-74, 1997   DOI   ScienceOn
13 Ralf Hartmut Guting, 'An Introduction to Spatial Database Systems,' VLDB Journal Vol.3, No.4, pp.357-399, 1994   DOI