Garuda - Garba Rujukan Digital

Data Quality Management dalam Data Warehouse: Tinjauan Literatur Tiara Aziza; David Saro; Nofri Yudi Arifin; Romiko Afriantoni; Aprizal Y; Atman Lucky Fernandes
Jurnal Responsive Teknik Informatika Vol 9 No 02 (2025): JR : Jurnal Responsive Teknik Informatika
Publisher : LPPM Universitas Ibnu Sina Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36352/jr.v9i02.1476

This study presents a systematic literature review of Data Quality Management (DQM) in data warehouse environments, aiming to map key dimensions, processes, and architectural/technological enablers, and to identify research gaps. Searches were conducted across Scopus, ScienceDirect, IEEE Xplore, ACM Digital Library, SpringerLink, and Google Scholar (as a complement) for the period 2009–2025, following PRISMA 2020. Of 200 initial records, 133 were excluded during the first screening, 67 underwent further assessment, and 6 studies met the inclusion criteria for in-depth analysis. Thematic synthesis indicates that effective DQM rests on four integrated pillars: (1) standardized quality dimensions and metrics (accuracy, completeness, consistency, timeliness, and traceability), (2) prevention–detection–correction processes embedded along the ETL/ELT pipeline (including consistent SCD policies and handling of late-arriving data), (3) architectural/technological support (automated data tests within CI/CD, catalogs/metadata, data lineage, observability, and data contracts), and (4) governance that clarifies roles and accountability (data owners/stewards) with incident-response procedures. Practically, organizations should start from critical data elements and high-priority consumption paths, translating SLA/SLI into executable rules. Limitations include the small number of included studies and contextual heterogeneity, motivating further work on cross-domain metric standardization, open DQM benchmarks, cost–benefit evaluations of observability/contract enforcement, and the impact of data quality on analytic/AI performance in near real-time settings.

Api Response Time Prediction Using a Deep Learning Model on Web Application Load Testing Simulation Data Defnizal Defnizal; Atman Lucky Fernandes; Aprizal Y; David Saro; Ghea Paulina Suri; Nofri Yudi Arifin; Romiko Afriantoni; Willy Rizki Perdana
Jurnal Responsive Teknik Informatika Vol 10 No 01 (2026): JR : Jurnal Responsive Teknik Informatika
Publisher : LPPM Universitas Ibnu Sina Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36352/jr.v10i01.1539

Web application performance, particularly application programming interface (API) response time, is one of the primary determinants of user experience and system reliability, especially under high-load conditions. Conventional load testing is reactive, as it can only measure actual response time after a given load has been applied to the system, creating a need for a predictive approach capable of estimating API response time from load and server-resource conditions. This study applies a deep learning model in the form of a Multi-Layer Perceptron (MLP) with three hidden layers to predict API response time, and compares its performance against two baseline models, namely Linear Regression and Random Forest Regressor. Due to limited access to sensitive real-world production data, this study uses a simulated load-testing dataset of 500 samples generated programmatically, comprising ten load and server-resource features such as concurrent users, requests per second, payload size, database query count, cache hit ratio, and CPU and memory utilization, with non-linear patterns representing resource-contention effects under high load. The data was split into 70% training and 30% testing, then evaluated using Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), Mean Absolute Percentage Error (MAPE), and the coefficient of determination (R²). Experimental results show that the Deep Learning (MLP) model achieved the best predictive performance with an RMSE of 24.86 ms, MAPE of 19.33%, and R² of 0.9009, outperforming Linear Regression (RMSE 26.25 ms, R² 0.8895) and Random Forest (RMSE 27.90 ms, R² 0.8751), although Linear Regression's MAE was slightly lower (19.34 ms versus 19.53 ms). Feature-importance analysis indicates that the number of concurrent users, database query count, and CPU utilization are the most dominant factors influencing API response time. To ground the simulated scenario in a concrete example, a small real demonstration web application was also built and load-tested; its qualitative behavior (response time increasing with concurrency) is consistent with the assumptions underlying the simulated dataset. These findings indicate that the deep learning model is better able to capture non-linear patterns caused by resource contention compared to a linear model or a tree-based ensemble, suggesting potential use as a predictive component in auto-scaling strategies or web-application capacity planning, with the caveat that these results remain a preliminary study requiring further validation using real production data.

Api Response Time Prediction Using a Deep Learning Model on Web Application Load Testing Simulation Data Defnizal Defnizal; Atman Lucky Fernandes; Aprizal Y; David Saro; Ghea Paulina Suri; Nofri Yudi Arifin; Romiko Afriantoni; Willy Rizki Perdana
Jurnal Responsive Teknik Informatika Vol 10 No 01 (2026): JR : Jurnal Responsive Teknik Informatika
Publisher : LPPM Universitas Ibnu Sina Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36352/jr.v10i01.1539

Web application performance, particularly application programming interface (API) response time, is one of the primary determinants of user experience and system reliability, especially under high-load conditions. Conventional load testing is reactive, as it can only measure actual response time after a given load has been applied to the system, creating a need for a predictive approach capable of estimating API response time from load and server-resource conditions. This study applies a deep learning model in the form of a Multi-Layer Perceptron (MLP) with three hidden layers to predict API response time, and compares its performance against two baseline models, namely Linear Regression and Random Forest Regressor. Due to limited access to sensitive real-world production data, this study uses a simulated load-testing dataset of 500 samples generated programmatically, comprising ten load and server-resource features such as concurrent users, requests per second, payload size, database query count, cache hit ratio, and CPU and memory utilization, with non-linear patterns representing resource-contention effects under high load. The data was split into 70% training and 30% testing, then evaluated using Mean Absolute Error (MAE), Root Mean Squared Error (RMSE), Mean Absolute Percentage Error (MAPE), and the coefficient of determination (R²). Experimental results show that the Deep Learning (MLP) model achieved the best predictive performance with an RMSE of 24.86 ms, MAPE of 19.33%, and R² of 0.9009, outperforming Linear Regression (RMSE 26.25 ms, R² 0.8895) and Random Forest (RMSE 27.90 ms, R² 0.8751), although Linear Regression's MAE was slightly lower (19.34 ms versus 19.53 ms). Feature-importance analysis indicates that the number of concurrent users, database query count, and CPU utilization are the most dominant factors influencing API response time. To ground the simulated scenario in a concrete example, a small real demonstration web application was also built and load-tested; its qualitative behavior (response time increasing with concurrency) is consistent with the assumptions underlying the simulated dataset. These findings indicate that the deep learning model is better able to capture non-linear patterns caused by resource contention compared to a linear model or a tree-based ensemble, suggesting potential use as a predictive component in auto-scaling strategies or web-application capacity planning, with the caveat that these results remain a preliminary study requiring further validation using real production data.

Prediksi Kelulusan Mahasiswa Menggunakan Algoritma Naive Bayes: Studi Kasus Universitas Ibnu Sina Batam Willy Rizki Perdana; Romiko Afriantoni; Sherly Agustini; David Saro; Aprizal Y
Jurnal Responsive Teknik Informatika Vol 8 No 02 (2024): JR : Jurnal Responsive Teknik Informatika
Publisher : LPPM Universitas Ibnu Sina Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36352/jr.v8i02.1438

Tingkat kelulusan mahasiswa merupakan indikator penting kualitas pendidikan tinggi. Penelitian ini bertujuan mengembangkan model prediksi kelulusan mahasiswa menggunakan algoritma Naive Bayes dengan memanfaatkan data akademik, sosial-demografis, dan ekonomi mahasiswa di Universitas Ibnu Sina Batam. Dataset mencakup 1.247 rekaman data mahasiswa Program Studi Teknik Informatika dan Sistem Informasi angkatan 2017–2021. Metode validasi menggunakan stratified 10-fold cross-validation. Hasil menunjukkan akurasi 89,74%, presisi 88,31%, recall 91,05%, dan F1-Score 89,66%. Perbandingan dengan Decision Tree dan SVM menunjukkan Naive Bayes unggul dalam efisiensi komputasi. IPK semester 1–4 dan tingkat kehadiran terbukti sebagai prediktor paling signifikan.

Prediksi Kelulusan Mahasiswa Menggunakan Algoritma Naive Bayes: Studi Kasus Universitas Ibnu Sina Batam Willy Rizki Perdana; Romiko Afriantoni; Sherly Agustini; David Saro; Aprizal Y
Jurnal Responsive Teknik Informatika Vol 8 No 02 (2024): JR : Jurnal Responsive Teknik Informatika
Publisher : LPPM Universitas Ibnu Sina Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36352/jr.v8i02.1438

Tingkat kelulusan mahasiswa merupakan indikator penting kualitas pendidikan tinggi. Penelitian ini bertujuan mengembangkan model prediksi kelulusan mahasiswa menggunakan algoritma Naive Bayes dengan memanfaatkan data akademik, sosial-demografis, dan ekonomi mahasiswa di Universitas Ibnu Sina Batam. Dataset mencakup 1.247 rekaman data mahasiswa Program Studi Teknik Informatika dan Sistem Informasi angkatan 2017–2021. Metode validasi menggunakan stratified 10-fold cross-validation. Hasil menunjukkan akurasi 89,74%, presisi 88,31%, recall 91,05%, dan F1-Score 89,66%. Perbandingan dengan Decision Tree dan SVM menunjukkan Naive Bayes unggul dalam efisiensi komputasi. IPK semester 1–4 dan tingkat kehadiran terbukti sebagai prediktor paling signifikan.

Title

Found 15 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 15 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 15 Documents
Search