Performance evaluation of spatialhadoop for big web mapping data

Erfan Farhangi Maleki, Mozhgan Nasr Azadani, Nasser Ghadiri

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

4 Citations (Scopus)

Abstract

Web mapping services are utilizing and overlaying different layers of maps gained by an information system for spatial data. This technique allows simple sharing of spatial data. However, with the enormous amounts of big spatial data that support emerging web mapping applications, processing and analyzing such data as well as preserving high levels of performance have received a lot of attention especially in NoSQL community. However, the performance and deployment aspects of the proposed architectures need to be evaluated and compared with well-known relational architectures. In this paper, we investigate the performance of SpatialHadoop and compare it against a variety of datasets and with the use of different operations including index creation, K-Nearest Neighbor (KNN), spatial join, and so on. The results of this study demonstrate that as the volume of data increases, SpatialHadoop scales well and performs better than the relational engine. Also, the performance of this tool on the same datasets in two kinds of operations is examined with SQL Server database. The experiments have shown that for a large amount of data, SpatialHadoop is more scalable and has a relatively better performance than SQL Server.
Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Web Research (ICWR), Tehran, Iran, 27 - 28 April 2016
PublisherIEEE
Pages60-65
Number of pages6
ISBN (Print)9781509021666
DOIs
Publication statusPublished - 2016
EventInternational Conference on Web Research -
Duration: 19 Apr 2017 → …

Conference

ConferenceInternational Conference on Web Research
Period19/04/17 → …

Fingerprint

Dive into the research topics of 'Performance evaluation of spatialhadoop for big web mapping data'. Together they form a unique fingerprint.

Cite this