CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Improvisation to the R*-Tree kNN Join Principles in Distributed Environment

by P.xavier, F.sagayaraj Francis
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 101 - Number 14
Year of Publication: 2014
Authors: P.xavier, F.sagayaraj Francis
10.5120/17755-8851

P.xavier, F.sagayaraj Francis . Improvisation to the R*-Tree kNN Join Principles in Distributed Environment. International Journal of Computer Applications. 101, 14 ( September 2014), 20-24. DOI=10.5120/17755-8851

@article{ 10.5120/17755-8851,
author = { P.xavier, F.sagayaraj Francis },
title = { Improvisation to the R*-Tree kNN Join Principles in Distributed Environment },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 101 },
number = { 14 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 20-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume101/number14/17755-8851/ },
doi = { 10.5120/17755-8851 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:31:39.833950+05:30
%A P.xavier
%A F.sagayaraj Francis
%T Improvisation to the R*-Tree kNN Join Principles in Distributed Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 101
%N 14
%P 20-24
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper identifies the scope for improvement in the execution of baseline kNN join algorithms in a distributed environment. Improvements are suggested and the improved methods are applied in performing kNN joins on R*-Trees. The effectiveness of the proposed improvements have been experimentally verified and presented.

References
  1. Jeffrey Dean and Sanjay Ghemawat, 2004, "Mapreduce: simplified data processing on large clusters", Proceedings of the 6th Conference on Symposium on Operating Systems Design & Implementation, vol. 6.
  2. Guttman, 1984, "R-trees: A dynamic index structure for spatial searching," Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47-57.
  3. N. Beckmann, H. -P. Krieger, R. Schneider and B. Seeger, 1990, "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.
  4. V. Gaede and 0. Guenther, 1998, "Multidimensional access methods," ACM Computing Surveys, vol. 30, no. 2, pp. 170-231.
  5. Y. Manolopoulos, A. Nanopoulos, A. N. Papadopoulos and Y. Theodoridis, 2003, "R-trees have grown everywhere," Technical Report, Available at http://citeseer. ist. psu. edu/706599. html.
  6. S. Brakatsoulas, D. Pfoser and Y. Theodoridis, 2002, "Revisiting R-tree construction principles," Proceedings of the 6th ADBIS Conference, pp. 149-162.
  7. L. Chen, R. Choubey and E. A. Rundensteiner, 1998, "Bulk-insertions into R-trees using the small-tree-large-tree approach," Proceedings of the 6th ACM GIS Conference, pp. 161-162.
  8. Daniar Achakeev, Marc Seidemann, Markus Schmidt and Bernhard Seeger, 2012, "Sort-based parallel loading of R-trees," Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, pp. 62-70.
  9. Faloutsos and I. Kamel, 1994, "Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension," Proceedings of the 13th ACMPODS Conference, pp. 4-13.
  10. I. Kamel and C. Faloutsos, 1994, "Hilbert R-tree: An improved R-tree using fractals," Proceedings of the 20th International Conference on Very Large Databases, pp. 500-509.
  11. F. Sagayaraj Francis and P. Xavier, 2014, "Amendments to the R*-Tree Construction Principles in Distributed Environment", International Journal of Engineering Research & Technology, vol. 3, Issue 5.
  12. Christos Doulkeridis and Kjetil Norvag, 2013, "A Survey of Large-Scale Analytical Query Processing in Mapreduce," The VLDB Journal, DOI: 10. 1007/s00778-013-0319-9.
  13. Himanshu Gupta, Bhupesh Chawda, Sumit Negi, Tanveer A. Faruquie, L. V. Subramaniam and Mukesh Mohania, 2013, "Processing multi-way spatial joins on map-reduce," Proceedings of the 16th International Conference on Extending Database Technology, pp. 113-124.
  14. Afrati, F. N. and Ullman, J. D. , 2010, "Optimizing Joins in a Map-Reduce Environment", Proceedings of the 13th International Conference on Extending Database Technology, pp. 99–110.
  15. Nodarakis, N. ; Pitoura, E. ; Sioutas, S. ; Tsakalidis, A. ; Tsoumakos, D. ; and Tzimas, G. , 2014, "Efficient Multidimensional AkNN Query Processing in the Cloud", Proceeding of the 25th International Conference on Database and Expert Systems Applications, pp. 1016-1027.
  16. Lu, W. , Shen, Y. , Chen, S. and Ooi, B. C. , 2012, "Efficient Processing of k Nearest Neighbor Joins using Mapreduce", Proceedings of the VLDB Endowment, vol. 5, Issue 10.
  17. Chi Zhang, Feifei Li and Jeffrey Jestes, 2012, "Efficient parallel kNN joins for large data in Mapreduce," Proceedings of the 15th International Conference on Extending Database Technology, pp. 38-49.
Index Terms

Computer Science
Information Sciences

Keywords

R*-Trees kNN join Hadoop Mapreduce z- values.

Powered by PhDFocusTM