Perbandingan Kinerja Teknik Index Bitmap dan B-Tree dalam Optimasi Query pada Database Oracle
DOI:
https://doi.org/10.26418/justin.v13i2.84906Keywords:
Perbandingan Kinerja Index, Index, Bitmap, B-Tree, Optimasi Query, Database OracleAbstract
Penelitian ini bertujuan untuk mengevaluasi efektivitas teknik indexing dalam pengolahan data besar, khususnya dalam sistem basis data Oracle. Fokus utama penelitian ini adalah membandingkan dua teknik indexing yang paling umum digunakan, yaitu Index Bitmap dan B-Tree, untuk mengukur kinerja mereka dalam hal waktu eksekusi, penggunaan sumber daya (memori dan CPU), serta akurasi hasil pencarian. Eksperimen dilakukan dengan menggunakan dataset besar yang berasal dari sistem Revenue Accounting System (RAS) milik Direktorat Jenderal Pajak, yang mencakup lebih dari 600 juta baris data. Metode eksperimen yang digunakan melibatkan pembuatan kedua indeks pada tabel yang besar, diikuti dengan pengujian berbagai jenis query, seperti seleksi, agregasi, dan rentang data. Hasil penelitian menunjukkan bahwa Index Bitmap lebih efisien untuk query seleksi pada kolom dengan kardinalitas rendah, sementara B-Tree lebih unggul untuk query agregasi dan rentang data pada kolom dengan kardinalitas tinggi. Penggunaan memori juga menunjukkan perbedaan signifikan, dengan Index Bitmap lebih hemat memori, sedangkan B-Tree membutuhkan lebih banyak memori, tetapi lebih efisien pada operasi yang lebih kompleks. Temuan ini memberikan panduan praktis bagi pengembang aplikasi dan administrator basis data dalam memilih teknik indexing yang sesuai dengan jenis data dan query yang dihadapi. Hasil penelitian ini juga membuka peluang untuk penelitian lebih lanjut dalam pengujian teknik indexing pada platform basis data lain dan kondisi yang lebih beragam.References
S. Oktavia, E. Putri, N. A. Zahra, N. Racana Kuslaila, and S. Mukaromah, “Perbandingan Teknik Indexing Bitmap dan B-Tree pada Oracle Database,†Prosiding Seminar Nasional Teknologi dan Sistem Informasi (SITASI) 2023, pp. 6–7, 2023.
S. Phon-Amnuaisuk, S.-C. Haw, and M. Zaker, “An Adequate Design for Large Data Warehouse Systems: Bitmap index versus B-tree index,†International Journal Of Computers And Communications, vol. 2, no. 2, 2008.
J. Preetha, S. Lavanya, T. Kowsalya, C. Selvi, and M. Ganthimathi, “An Improved Framework for Bitmap Indexes and their Use in Data Warehouse Optimization,†2021.
S. Phon-Amnuaisuk, S.-C. Haw, and M. Zaker, Investigating design choices between Bitmap index and B-tree index for a large data warehouse system. 2008. [Online]. Available: https://www.researchgate.net/publication/228953064
X. Lyu, A. Kipf, P. Pfeil, D. Horn, J. Giceva, and T. Kraska, “CorBit: Leveraging Correlations for Compressing Bitmap Indexes,†2023. [Online]. Available: https://github.com/RoaringBitmap/CRoaring
M. Andrighetti et al., “Bitmap Index: A Processing-in-Memory Reconfigurable Implementation,†in Lecture Notes in Electrical Engineering, Springer, 2020, pp. 173–179. doi: 10.1007/978-3-030-37277-4_20.
B. Yildiz, K. Wu, S. Byna, and A. Shoshani, “Parallel membership queries on very large scientific data sets using bitmap indexes,†Concurr Comput, vol. 31, no. 15, Aug. 2019, doi: 10.1002/cpe.5157.
M. Kumar, T. K. Gupta, and D. U. Sarwe, “An Optimization of Bitmap Index Compression Technique in Bulk Data Movement Infrastructure,†IOP Conf Ser Mater Sci Eng, vol. 1099, no. 1, p. 012074, Mar. 2021, doi: 10.1088/1757-899x/1099/1/012074.
M. Yahyaoui, S. Amjad, L. Benameur, and I. Jellouli, “Efficient of bitmap join indexes for optimising star join queries in relational data warehouses,†2020.
P. Dadheech, A. Kumar, and V. Singh, “An optimization of bitmap index compression technique in bulk data movement infrastructure,†TARU Journal of Sustainable Technologies and Computing, vol. 1, no. 2, 3, 4, pp. 81–91, Nov. 2019, doi: 10.47974/2019.tjstc.003.
B. Yildiz, “Optimizing bitmap index encoding for high performance queries,†in Concurrency and Computation: Practice and Experience, John Wiley and Sons Ltd, Sep. 2021. doi: 10.1002/cpe.5943.
L. Thamsuhang, T. Bach, L. Thamsuhang Subba, C. Thomsen, and T. Bach Pedersen, “Aalborg Universitet Efficient indexing of hashtags using bitmap indices Efficient Indexing of Hashtags using Bitmap Indices,†2019.
C. Gao, S. Ballijepalli, and J. Wang, “Revisiting B-tree Compression: An Experimental Study,†Proceedings of the ACM on Management of Data, vol. 2, no. 3, pp. 1–25, May 2024, doi: 10.1145/3654972.
A. Aminuddin, M. Z. Saringat, S. A. Mostofa, A. Mustapha, and M. H. Hassan, “A Case Study on B-Tree Database Indexing Technique,†Journal of Soft Computing and Data Mining, vol. 1, no. 1, pp. 27–35, Jun. 2020, doi: 10.30880/jscdm.2020.01.01.004.
R. X. Ma, F. Wu, B. R. Dong, M. Zhang, W. J. Li, and C. S. Xie, “Write-Optimized B + Tree Index Technology for Persistent Memory,†J Comput Sci Technol, vol. 36, no. 5, pp. 1037–1050, Oct. 2021, doi: 10.1007/s11390-021-1247-6.
A. Setiadi, D. Darmawan, and D. Andharu, “Gradient Analysis In Implementation of B-Tree Indexing In Reporting Annual Tax Database,†vol. 7, no. 1, 2022.
S. Sprenger, P. Schäfer, and U. Leser, “BB-Tree: A practical and efficient main-memory index structure for multidimensional workloads,†in International Conference on Extending Database Technology, 2019.
R. Elmasri and S. B. Navathe, Fundamentals Of Database Systems Seventh Edition.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 JUSTIN (Jurnal Sistem dan Teknologi Informasi)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The author owns the copyright in his paper and agrees to publish his paper to JUSTIN by giving the rights to the first publication of his paper which is simultaneously licensed under the Creative Commons Attribution License, namely the Similar International 4.0 license (CC BY-NC-SA 4.0).
This is a human-readable summary of (and not a substitute for) the license. Disclaimer.
You are free to:Share "” copy and redistribute the material in any medium or format
Adapt "” remix, transform, and build upon the material
The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
Attribution "” You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
NonCommercial "” You may not use the material for commercial purposes.
ShareAlike "” If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
No additional restrictions "” You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
