Highest Order Voronoi Processing on Apache Spark
PUTU EKA BUDI PRADNYANA

Informasi Umum

Kode

18.04.665

Klasifikasi

C -

Jenis

Karya Ilmiah - Skripsi (S1) - Reference

Subjek

Computer Science

Dilihat

172 kali

Informasi Lainnya

Abstraksi

Voronoi diagram is a method that divides the plane into smaller area based on the nearest distance to an object. Highest Order Voronoi Diagram is a new variant of the Voronoi diagram. The complexity of HSVD construction is on O($m^{4}$), where m is the number of generator points. Highest order Voronoi diagram can be used on the field of query processing such as reverse k-nearest neighbour (RKNN), k farthest neighbour (KFN), k nearest neighbour(KNN), etc. From related works, there are method called Fast Labelling and Interchange Position (FLIP) and Left with Least-Angle Movement (LAM) used to construct highest order voronoi diagram. But, both of this method implemented on conventional computing and have limitation on number of points that can be processed and execution time is quite high. There is inefficiency of reuse a working set of data process by accessing disk repeatedly which caused the execution time is quite high and limit the number of points that can be processed. Beside that, conventional computing didn't utilize the available resources. There are frameworks that can be used to utilize the available resources to optimize the computing process called Apache Spark. Apache Spark distribute the task to all available resources and work well on iterative process that reuse a set of data because of the ability to keep needed data in memory. This minor thesis shows that with the help of Apache Spark framework, the number of point that can be processed increase to 24 with the execution time is 60\% faster than LAM implementation in average. Keywords: voronoi diagram, highest order, apache spark, spatial

• BUG1D2 - BAHASA INGGRIS I
• BUG1E2 - BAHASA INGGRIS II
• BUG2A2 - BAHASA INGGRIS III
• CSH453 - BASIS DATA SPASIAL
• CCH1A4 - DASAR ALGORITMA DAN PEMROGRAMAN
• CCH4A3 - PENULISAN PROPOSAL
• CCH1D4 - STRUKTUR DATA
• CCH4D4 - TUGAS AKHIR
• DPH1F4 - ALGORITMA DAN PEMROGRAMAN
• DPH1F4 - ALGORITMA DAN PEMROGRAMAN
• ISH1E3 - ALGORITMA DAN PEMROGRAMAN A
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• DPH1B4 - ALGORITMA DAN PEMROGRAMAN KOMPUTER
• DCH1F4 - ALGORITMA DAN PEMROGRAMAN LANJUT
• CCH1A4 - DASAR ALGORITMA DAN PEMROGRAMAN
• CCH1A4 - DASAR ALGORITMA DAN PEMROGRAMAN
• ISH1F1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN A
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• VSI1A4 - ALGORITMA DAN PEMROGRAMAN KOMPUTER
• VKI1E4 - ALGORITMA DAN PEMROGRAMAN
• VKI1J4 - ALGORITMA DAN PEMROGRAMAN LANJUT
• VAI1A4 - ALGORITMA DAN PEMROGRAMAN
• CII2B4 - STRUKTUR DATA
• CII4A2 - PENULISAN PROPOSAL
• CII4E4 - TUGAS AKHIR
• CPI2B4 - STRUKTUR DATA
• III4A4 - TUGAS AKHIR
• CII9G6 - PROPOSAL PENELITIAN

Koleksi & Sirkulasi

Seluruh 1 koleksi sedang dipinjam

Pengarang

Penerbit

Sirkulasi

Download / Flippingbook