Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More
An Effective Method to Answer OLAP Queries using R*-trees in Distributed Environment
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 107 - Number 19
Year of Publication: 2014
|
10.5120/18859-0474 |
Sagayaraj F Francis and P Xavier. Article: An Effective Method to Answer OLAP Queries using R*-trees in Distributed Environment. International Journal of Computer Applications 107(19):18-21, December 2014. Full text available. BibTeX
@article{key:article,
author = {F. Sagayaraj Francis and P. Xavier},
title = {Article: An Effective Method to Answer OLAP Queries using R*-trees in Distributed Environment},
journal = {International Journal of Computer Applications},
year = {2014},
volume = {107},
number = {19},
pages = {18-21},
month = {December},
note = {Full text available}
}
Abstract
Evaluation of OLAP queries is one of the challenging tasks in a database system. Attempts are being continuously made to improve the efficiency of the methods that answer OLAP queries. This paper makes one such attempt. This paper proposes a method in a Hadoop and MapReduce distributed environment. Experimental evaluation gives improved results due to the proposed method.
References
- Jeffrey Dean and Sanjay Ghemawat, "Mapreduce: simplified data processing on large clusters", Proceedings of the 6th Conference on Symposium on Operating Systems Design & Implementation, vol. 6, 2004.
- Guttman, "R-trees: A dynamic index structure for spatial searching," Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47-57, 1984.
- N. Beckmann, H. -P. Krieger, R. Schneider and B. Seeger, "The R*-tree: an efficient and robust access method for points and rectangles," Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 322-331, 1990.
- V. Gaede and 0. Guenther, "Multidimensional access methods," ACM Computing Surveys, vol. 30, no. 2, pp. 170-23 1, 1998.
- Y. Manolopoulos, A. Nanopoulos, A. N. Papadopoulos and Y. Theodoridis, "R-trees have grown everywhere," Technical Report, Available at http://citeseer. ist. psu. edu/706599. html (2003).
- S. Brakatsoulas, D. Pfoser and Y. Theodoridis, "Revisiting R-tree construction principles," Proceedings of the 6th ADBIS Conference, pp. 149-162, 2002.
- Z. X. Loh, T. W. Ling, C. -H. Ang, and S. Y. Lee. Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes. Proceedings of CIKM, pp. 60–67, 2002.
- D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. , "Efficient OLAP operations in spatial data warehouses", Proceedings of SSTD, pp. 443-449, 2001.
- Nikos Mamoulis, Spiridon Bakiras andPanos Kalnis, "Evaluation of Top-k OLAP Queries Using Aggregate R–Trees", Springer-Verlag LNCS 3633, pp. 236–253, 2005.
- F. Dehne, Q. Kong, A. Rau-Chaplin, H. Zaboli and R. Zhou, "A Distributed Tree Data Structure For Real-Time OLAP On Cloud Architectures", Proceedings of the Big Data Conference, pp. 499-505, 2013.
- Tyson Condie, Neil Conway, Peter Alvaro and Joseph M. Hellerstein, "Online Aggregation and Continuous Query support in MapReduce", Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 1115-1118, 2010.