Kurnia Kharisma Agung Samiadjie, . (2026) OPTIMASI PERFORMA WEBSITE PADA WEB PASAR HASIL BUMI MENGGUNAKAN ALGORITMA GRAPH PRUNING DAN LIST VIRTUALIZATION. Skripsi thesis, Universitas Pembangunan Nasional Veteran Jakarta.
|
Text
ABSTRAK.pdf Download (198kB) |
|
|
Text
AWAL.pdf Download (2MB) |
|
|
Text
BAB I.pdf Restricted to Repository UPNVJ Only Download (232kB) |
|
|
Text
BAB II.pdf Restricted to Repository UPNVJ Only Download (1MB) |
|
|
Text
BAB III.pdf Restricted to Repository UPNVJ Only Download (748kB) |
|
|
Text
BAB IV.pdf Restricted to Repository UPNVJ Only Download (8MB) |
|
|
Text
BAB V.pdf Download (202kB) |
|
|
Text
DAFTAR PUSTAKA.pdf Download (186kB) |
|
|
Text
RIWAYAT HIDUP.pdf Restricted to Repository UPNVJ Only Download (223kB) |
|
|
Text
LAMPIRAN.pdf Restricted to Repository UPNVJ Only Download (6MB) |
|
|
Text
HASIL PLAGIARISME.pdf Restricted to Repository staff only Download (13MB) |
|
|
Text
ARTIKEL KI.pdf Restricted to Repository staff only Download (549kB) |
Abstract
Digital transformation in the agriculture sector through the "Pasar Hasil Bumi" platform faces infrastructure constraints, where the devices used by the Women Farmers Group (Kelompok Wanita Tani or KWT) admins generally have low computational specifications. Large-scale inventory data manipulation (>1000 entities) on the standard Next.js framework burdens the browser's Main Thread due to the reconciliation mechanism with linear complexity $O(N)$, causing high Total Blocking Time (TBT) and Interaction to Next Paint (INP), which triggers minimal interactivity during interactions. To address these rendering scalability issues, this research implements the List Virtualization algorithm through List Virtualization techniques to limit active DOM nodes based on visual coordinates, and the Graph Pruning algorithm through Memoization techniques to prune redundant component re-render paths. The effectiveness of both algorithms was evaluated using an experimental method on an actual low-end device environment (Intel Core i3 10th Gen) by comparing four architectural scenarios. Test results showed that List Virtualization predominantly reduced TBT from 1175.5 ms (Baseline) to 697.25 ms, changing the rendering complexity to be constant relative to the viewport. Meanwhile, Graph Pruning proved effective in reducing latency in local interactions but caused memory overhead if applied individually during the initial load. The Combined Scenario proved to be the most optimal solution, yielding the lowest interaction latency and significantly improving the System Usability Scale (SUS) score from the Poor to Excellent category.
| Item Type: | Thesis (Skripsi) |
|---|---|
| Additional Information: | [No.Panggil: 2110511068] [Pembimbing: Neny Rosmawarni & Indra Permana Solihin] [Penguji 1: Henki Bayu Seta] [Penguji 2: Muhammad Panji Muslim] |
| Uncontrolled Keywords: | List Virtualization, Graph Pruning, Web Performance Optimization, Core Web Vitals, Next.js |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Fakultas Ilmu Komputer > Program Studi Informatika (S1) |
| Depositing User: | KURNIA KHARISMA AGUNG SAMIADJIE |
| Date Deposited: | 17 Mar 2026 02:21 |
| Last Modified: | 17 Mar 2026 02:21 |
| URI: | http://repository.upnvj.ac.id/id/eprint/42381 |
Actions (login required)
![]() |
View Item |
