Claim Missing Document
Check
Articles

Found 22 Documents
Search

Implementation of a Web-Based Marriage Registration and Referral Information System at the Bandungan Sub-District Religious Affairs Office Dheavita Reza Artamevia; Aji Priyambodo; Marsiska Ariesta Putri; Andreas Tigor Oktaga
Proceeding of the International Conference on Electrical Engineering and Informatics Vol. 1 No. 2 (2024): July : Proceeding of the International Conference on Electrical Engineering and
Publisher : Asosiasi Riset Teknik Elektro dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/iceei.v1i2.37

Abstract

The purpose of this research is to build a web-based information system for the Bandungan Sub-district Religious Affairs Office (KUA) that covers marriage registration, referral applications and receipt of marriage registration and referral reports. The research method used is the Research and Development (R&D) method. The R&D method is a research method used to produce certain products and test the effectiveness of these methods. In addition, this research uses the proven waterfall theory. The result of this research is to produce a web-based information system that is able to manage integrated marriage and referral registration data using R&D and Waterfall methods. This information system uses the PHP programming language and uses mysql data storage.
A Hybrid Data Structure and Algorithmic Approach for Efficient Memory Management and Query Processing in High Performance Software Systems Zulfikar Zulfikar; Febri Adi Prasetya; Marsiska Ariesta Putri
Programming and Algorithm Fundamentals Vol. 1 No. 1 (2026): January: Programming and Algorithm Fundamentals
Publisher : Asosiasi Pengelola Jurnal Informatika dan Komputer Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.66472/paf.v1i1.20

Abstract

In high-performance computing (HPC) environments, the need to balance memory efficiency and query performance is crucial for ensuring optimal system performance. Traditional data structures, such as B-trees and hash tables, often prioritize either memory usage or query speed, leading to suboptimal performance in memory-constrained systems. This paper proposes a hybrid data structure that combines the strengths of multiple traditional data structures to optimize both memory usage and query processing speed. The proposed hybrid structure integrates cache-conscious algorithms, dynamic memory allocation, and compression techniques for intermediate query results. The approach is evaluated through extensive benchmarking tests comparing it to standard data structures like B-trees and hash tables under various workloads. Results show that the hybrid data structure reduces memory overhead by up to 30% while maintaining query processing speeds up to 1.5 times faster than conventional methods. Furthermore, the hybrid structure demonstrates robust performance across different types of queries, including both point and range queries, ensuring versatility and efficiency. The findings indicate that this hybrid approach provides a promising solution for HPC systems, where both memory efficiency and query speed are essential. Future research can explore extending the hybrid structure to distributed systems and emerging technologies, further improving its scalability and adaptability to new computational paradigms.