PENGGUNAAN ALGORITMA GEOSHASHING DALAM PENCARIAN LETAK INFORMASI GEOGRAFIS PENGGANTI KOOORDINAT LATITUDE DAN LONGITUDE
USE OF THE GEOSHASHING ALGORITHM IN SEARCHING FOR THE LOCATION OF GEOGRAPHICAL INFORMATION IN SUBSTITUTION OF LATITUDE AND LONGITUDE COORDINATES
Abstract
Dalam era digital saat pencarian data geografis menjadi semakin penting dalam aplikasi lokasi, termasuk pemetaan, navigasi, dan analisis lingkungan tempat dalam suatu lokasi. algoritma geohashing menawarkan pendekatan yang efisien untuk pengkodekan dan menyimpan data geografis dalam format string,String ini menggunakan alfanumerik yang dihasilkan oleh geohashing dari angka dan huruf dalam pencarian titik lokasi dengan koordinat, hal ini juga dapat menawarkan lapisan akses dari data lokasi yang sensitif. Penelitian ini bertujuan untuk mengeksplorasi penerapan algoritma geohashing dalam manajemen data geografis. algoritma geohashing dalam pencarian letak informasi geografis sebagai alternatif pengganti koordinat latitude dan longitude. Secara khusus, penelitian ini menganalisis efisiensi geohashing dalam kompresi data, akurasi lokalisasi penggunaan geohashing memungkinkan pengelompokan data geografis yang lebih baik, dan mendukung pencarian data spasial seperti pencarian letak lokasi dan pencarian titik koordinat dalam wilayah tertentu. algoritma geohashing diimplementasikan dalam data geografis dan diuji untuk berbagai skenario pencarian. Dari hasil penelitian menunjukkan bahwa geohashing dapat meningkatkan kecepatan pencarian informasi geografis secara signifikan algoritma geohashing membuktikan tindakan sebagai alat yang efektif dalam manajemen dan pencarian data geografis,pada pencarian data koordinat lokasi ini juga dapat memberikan alternatif untuk mendapatkan latitude dan longitude dari suatu lokasi. Hasil penelitian menunjukkan bahwa geohashing dapat meningkatkan kecepatan pencarian informasi geografis secara signifikan, terutama dalam menjangkau suatu lokasi dengan level grid kotak data yang kecil dan besar sesuai karakter string yang dimasukan. Penggunaan geohashing tidak hanya meningkatkan efisiensi dan kecepatan pencarian tetapi juga memberikan manfaat tambahan dalam hal pengelolaan dan perlindungan data geografis.algoritma geohashing adalah metode yang digunakan untuk mengkodekan koordinat geografis yang menghasilkan lokasi acak.Pengujian pada sistem ini dilakukan dengan cara melakukan akses geografis kepada API aplikasi lokasi yang sudah dibuat sesuai permintaan yang diminta untuk mendapatkan informasi data geografis dan titik lokasi.
References
Y. Fernando, M. A. Mustaqov, and D. A. Megawaty, “Penerapan Algoritma a-Star Pada Aplikasi Pencarian Lokasi Fotografi Di Bandar Lampung Berbasis Android,” J. Teknoinfo, vol. 14, no. 1, p. 27, 2020, doi: 10.33365/jti.v14i1.509.
B. S. S. M. T. Gunita Mustika Hati, Andri Suprayogi S.T. M.T., “Aplikasi Penanda Lokasi Peta Digital Berbasis Mobile Gis Pada Smartphone Android,” vol. 2, pp. 26–40, 2013.
D. O. Sihombing, “Perancangan Aplikasi Web Untuk Pencarian Lokasi Dan Rute Rumah Sakit Berbasis Google Maps API,” Ekp, vol. 13, no. 1, pp. 1–11, 2015.
I. Betkier and M. Oszczypała, “Journal Pre-proofs A novel approach to traffic modelling based on road parameters, weather con-ditions and GPS data using feedforward neural networks,” vol. 245, no. December 2023, 2023, doi: 10.1016/j.eswa.2023.123067.
M. Liang, J. Su, R. W. Liu, and J. S. L. Lam, “AISClean: AIS data-driven vessel trajectory reconstruction under uncertain conditions,” Ocean Eng., vol. 306, no. May, p. 117987, 2024, doi: 10.1016/j.oceaneng.2024.117987.
“W-Hilbert: A W-shaped Hilbert curve and coding method for multiscale geospatial data index,” Int. J. Appl. Earth Obs. Geoinf., vol. 118, no. November 2022, 2023, doi: 10.1016/j.jag.2023.103298.
I. R. Bakti, Y. P. Bunda, and C. T. Utari, “Rancang Bangun Sistem Informasi Geografis (Sig) Lokasi Praktek Kerja Industri (Prakerin) Smk Methodist Medan Berbasis Web,” Rabit J. Teknol. dan Sist. Inf. Univrab, vol. 6, no. 1, pp. 1–6, 2021, doi: 10.36341/rabit.v6i1.1505.
O. Järv, H. Tenkanen, M. Salonen, R. Ahas, and T. Toivonen, “Dynamic cities: Location-based accessibility modelling as a function of time,” Appl. Geogr., vol. 95, no. April, pp. 101–110, 2018, doi: 10.1016/j.apgeog.2018.04.009.
K. Hasanzadeh, A. Kajosaari, D. Häggman, and M. Kyttä, “A context sensitive approach to anonymizing public participation GIS data: From development to the assessment of anonymization effects on data quality,” Comput. Environ. Urban Syst., vol. 83, no. July, p. 101513, 2020, doi: 10.1016/j.compenvurbsys.2020.101513.
I. R. Munthe, E. W. Wardana, and G. J. Yanris, “Rancang Bangun Sistem Informasi Geografis Pemetaan Hutan Pada Kabupaten Labuhan-Batu,” Rabit J. Teknol. dan Sist. Inf. Univrab, vol. 6, no. 2, pp. 77–82, 2021, doi: 10.36341/rabit.v6i2.1717.
M. Walalayo, A. V. Vitianingsih, A. L. Maukar, E. W. Puspitarini, and F. Marissa, “Web-Gis Kesesuaian Lahan Untuk Pengembangan Hutan Kota Menggunakan Metode Multi-Criteria Decision Making,” Rabit J. Teknol. dan Sist. Inf. Univrab, vol. 6, no. 2, pp. 100–115, 2021, doi: 10.36341/rabit.v6i2.1739.
X. Xu, J. Wang, S. Poslad, X. Rui, G. Zhang, and Y. Fan, “Exploring intra-urban human mobility and daily activity patterns from the lens of dockless bike-sharing: A case study of Beijing, China,” Int. J. Appl. Earth Obs. Geoinf., vol. 122, no. May, p. 103442, 2023, doi: 10.1016/j.jag.2023.103442.
M. Lloyd et al., “Predicting spatial variations in annual average outdoor ultrafine particle concentrations in Montreal and Toronto, Canada: Integrating land use regression and deep learning models,” Environ. Int., vol. 178, no. June, p. 108106, 2023, doi: 10.1016/j.envint.2023.108106.
N. Huda and M. Megawaty, “Analisis Kinerja Website Dinas Komunikasi dan Informatika Menggunakan Metode Pieces,” J. Sisfokom (Sistem Inf. dan Komputer), vol. 10, no. 2, pp. 155–161, 2021, doi: 10.32736/sisfokom.v10i2.1018.
Uminingsih, M. Nur Ichsanudin, M. Yusuf, and S. Suraya, “Pengujian Fungsional Perangkat Lunak Sistem Informasi Perpustakaan Dengan Metode Black Box Testing Bagi Pemula,” STORAGE J. Ilm. Tek. dan Ilmu Komput., vol. 1, no. 2, pp. 1–8, 2022, doi: 10.55123/storage.v1i2.270.
Copyright (c) 2024 Rabit : Jurnal Teknologi dan Sistem Informasi Univrab
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright Notice
The copyright of the received article shall be assigned to the publisher of the journal. The intended copyright includes the right to publish the article in various forms (including reprints). The journal maintains the publishing rights to published articles. Therefore, the author must submit a statement of the Copyright Transfer Agreement.*)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
In line with the license, authors and any users (readers and other researchers) are allowed to share and adapt the material only for non-commercial purposes. In addition, the material must be given appropriate credit, provided with a link to the license, and indicated if changes were made. If authors remix, transform or build upon the material, authors must distribute their contributions under the same license as the original.
Please find the rights and licenses in RABIT : Jurnal Teknologi dan Sistem Informasi Univrab. By submitting the article/manuscript of the article, the author(s) accept this policy.
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
2. Author’s Warranties
The author warrants that the article is original, written by stated author(s), has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author(s).
3. User Rights
RABIT's spirit is to disseminate articles published are as free as possible. Under the Creative Commons license, RABIT permits users to copy, distribute, display, and perform the work for non-commercial purposes only. Users will also need to attribute authors and RABIT on distributing works in the journal.
4. Rights of Authors
Authors retain all their rights to the published works, such as (but not limited to) the following rights;
- Copyright and other proprietary rights relating to the article, such as patent rights,
- The right to use the substance of the article in own future works, including lectures and books,
- The right to reproduce the article for own purposes,
- The right to self-archive the article,
- The right to enter into separate, additional contractual arrangements for the non-exclusive distribution of the article's published version (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal (RABIT : Jurnal Teknologi dan Sistem Informasi Univrab).
5. Co-Authorship
If the article was jointly prepared by other authors, any authors submitting the manuscript warrants that he/she has been authorized by all co-authors to be agreed on this copyright and license notice (agreement) on their behalf, and agrees to inform his/her co-authors of the terms of this policy. RABIT will not be held liable for anything that may arise due to the author(s) internal dispute. RABIT will only communicate with the corresponding author.
6. Royalties
This agreement entitles the author to no royalties or other fees. To such extent as legally permissible, the author waives his or her right to collect royalties relative to the article in respect of any use of the article by RABIT.
7. Miscellaneous
RABIT will publish the article (or have it published) in the journal if the article’s editorial process is successfully completed. RABIT's editors may modify the article to a style of punctuation, spelling, capitalization, referencing and usage that deems appropriate. The author acknowledges that the article may be published so that it will be publicly accessible and such access will be free of charge for the readers as mentioned in point 3.