View Item 
      •   IPB Repository
      • Dissertations and Theses
      • Master Theses
      • MT - Mathematics and Natural Science
      • View Item
      •   IPB Repository
      • Dissertations and Theses
      • Master Theses
      • MT - Mathematics and Natural Science
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      A Development of Spatial Skyline Query Based on Surrounding Environment for Data Streaming Using Apache- Spark

      Thumbnail
      View/Open
      Fulltext (18.92Mb)
      Date
      2019
      Author
      Firzatullah, Raden Muhamad
      Djatna, Taufik
      Annisa
      Metadata
      Show full item record
      Abstract
      Previous studies of spatial skyline queries based on the surrounding environment posed a challenge in handling skyline searches that supported mobile users. This study introduces a method which allows users to search for spatial objects dynamically. Online streaming data services are currently available to support user movements. With this condition, streaming data requires a longer execution time in processing. This work examines the effectiveness and efficiency of the Apache-Spark framework in developing spatial skyline queries based on the surrounding environment algorithm for data streaming. Further implementation of this algorithm on mobile devices can provide better location access for users. Comparative analysis of processing time was carried by comparing single processing, parallel distributed computing, and cluster computing algorithms with various measurement evaluation parameters. Result of the test on "number of types in surrounding environment" parameter shows that the execution time of parallel and cluster computing is faster than single computing, 63.694 and 72.772 times faster, respectively. Test on the "raw data size" parameter indicates that parallel computing execution time is 46.553 times faster than single computing, while cluster computing is 74.187 times faster than single computing. In the "main facility search radius" parameter, cluster computing is 45.224 times faster than single computing, and parallel computing is 77.022 times faster than single computing. Lastly, the "number grid" parameter indicates that the execution time for both parallel and cluster computing is faster than single computing, 157.944 and 276.251 times faster, respectively.
      URI
      http://repository.ipb.ac.id/handle/123456789/98738
      Collections
      • MT - Mathematics and Natural Science [4133]

      Copyright © 2020 Library of IPB University
      All rights reserved
      Contact Us | Send Feedback
      Indonesia DSpace Group 
      IPB University Scientific Repository
      UIN Syarif Hidayatullah Institutional Repository
      Universitas Jember Digital Repository
        

       

      Browse

      All of IPB RepositoryCollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

      My Account

      Login

      Application

      google store

      Copyright © 2020 Library of IPB University
      All rights reserved
      Contact Us | Send Feedback
      Indonesia DSpace Group 
      IPB University Scientific Repository
      UIN Syarif Hidayatullah Institutional Repository
      Universitas Jember Digital Repository