Improving the quality of an R-tree using the Map-Reduce framework
VNH Cong, KW Lee, IH Joo, OH Kwon… - Advanced Multimedia and …, 2017 - Springer
An R-tree is an index structure that enables fast access to multi-dimensional data.
Constructing an R-tree for a given data set yields a more efficient R-tree structure than
incrementally building one as data are inserted. However it usually takes a lot of time to
construct an R-tree for a huge volume of data. In this paper, we propose a parallel R-Tree
construction scheme based on a Hadoop framework. The proposed scheme divides the data
into partitions, builds local R-trees in parallel, and merges them to construct an R-tree that …
Constructing an R-tree for a given data set yields a more efficient R-tree structure than
incrementally building one as data are inserted. However it usually takes a lot of time to
construct an R-tree for a huge volume of data. In this paper, we propose a parallel R-Tree
construction scheme based on a Hadoop framework. The proposed scheme divides the data
into partitions, builds local R-trees in parallel, and merges them to construct an R-tree that …
[CITATION][C] Im⁃ proving the quality of an R-tree using the map reduce frame⁃ work
HC VIET-NGU, L KANG-WOO, J IN-HAK - International Conference on Multimedia …, 2017
Showing the best results for this search. See all results