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

IEICE Transactions on Information and Systems

Volumn E88-D, Issue 11, 2005, Pages 2544-2554

  Hong, Seokjin ^a   Moon, Bongki ^b,c   Lee, Sukho ^a,d  

^a Seoul National University   (South Korea)

^b University of Arizona   (United States)

^c UNIVERSITY OF ARIZONA   (United States)

^d Database Research Laboratory   (United States)

Author keywords

Aggregate R tree; Data warehouse; Range top k query; Spatial database

Indexed keywords

ALGORITHMS; DATA WAREHOUSES; DATABASE SYSTEMS; QUERY LANGUAGES;

AGGREGATE R-TREE; DATA WAREHOUSE; RANGE TOP-K QUERY; SPATIAL DATABASE;

DATA STRUCTURES;

EID: 29144493129     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e88-d.11.2544     Document Type: Article

References (17)

1. R.H. Güting, "An introduction to spatial database systems," VLDB J., vol.3, no.4, pp.357-399, 1994.
2. S. Chaudhuri and U. Dayal, "An overview of data warehousing and OLAP technology," SIGMOD Record, vol.26, no.1, pp.65-74, 1997.
3. I. Lazaridis and S. Mehrotra, "Progressive approximate aggregate queries with a multi-resolution tree structure," Proc. 2001 ACM SIGMOD International Conference on Management of Data, pp.401-412, Santa Barbara, CA, May 2001, ACM Press, 2001.
4. S. Hong, B. Song, and S. Lee, "Efficient execution of range aggregate queries in data warehouse environments," Conceptual Modeling - ER 2001: 20th International Conference on Conceptual Modeling, pp.299-310, Yokohama, Japan, Springer, 2001.
5. D. Papadias, P. Kalnis, J. Zhang, and Y. Tao, "Efficient OLAP operations in spatial data warehouses," Advances in Spatial and Temporal Databases: Proc. 7th International Symposium, SSTD 2001, pp.443-459, Redondo Beach, CA, July 2001, Springer, 2001.
6. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, "Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total," Proc. Twelfth International Conference on Data Engineering, pp.152-159, New Orleans, LA, Feb./March 1996, IEEE Computer Society, 1996.
7. A. Guttman, "R-trees: A dynamic index structure for spatial searching," SIGMOD'84, Proc. Annual Meeting, pp.47-57, Boston, MA, June 1984, ACM Press, 1984.
8. O. Günther and J. Bilmes, "Tree-based access methods for spatial databases: Implementation and performance evaluation," TKDE, vol.3, no.3, pp.342-356, 1991.
9. C.T. Ho, R. Agrawal, N. Megiddo, and R. Srikant, "Range queries in OLAP data cubes," SIGMOD 1997, Proc. ACM SIGMOD International Conference on Management of Data, pp.73-88, Tucson, AZ, May 1997, ACM Press, 1997.
10. S. Geffner, D. Agrawal, A.E. Abbadi, and T.R. Smith, "Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes," Proc. 15th International Conference on Data Engineering, pp.328-335, Sydney, Austrialia, March 1999, IEEE Computer Society, 1999.
11. C.Y. Chan and Y.E. Ioannidis, "Hierarchical prefix cubes for rangesum queries," VLDB'99, Proc. 25th International Conference on Very Large Data Bases, pp.675-686, Edinburgh, UK, Sept. 1999, Morgan Kaufmann, 1999.
12. Z.X. Loh, T.W. Ling, C.H. Ang, and S.Y. Lee, "Adaptive method for range top-k queries in OLAP data cubes," DEXA'02, pp.648-657, Springer, 2002.
13. G.R. Hjaltason and H. Samet, "Ranking in spatial databases," Advances in Spatial Databases, Proc. 4th International Symposium, SSD'95, Portland, ME, Aug. 1995, Lecture Notes in Computer Science 951, pp.83-95, Springer, 1995.
14. I. Kamel and C. Faloutsos, "On packing R-trees," CIKM 93, Proc. Second International Conference on Information and Knowledge Management, pp.490-499, Washington, DC, Nov. 1993, ACM, 1993.
15. S. Berchtold, C. Böhm, and H.P. Kriegel, "The pyramid-technique: Towards breaking the curse of dimensionality," SIGMOD 1998, Proc. ACM SIGMOD International Conference on Management of Data, ed. L.M. Haas and A. Tiwary, pp.142-153, Seattle, WA, June 1998, ACM Press, 1998.
16. TPC-H http://www.tpc.org/tpch/, 2004.
17. TIGER/Line http://www.census.gov/geo/www/tiger/, 2002.