<![CDATA[The performance of the information system at the Regional Library Agency of Bengkulu Province currently experiences responsiveness constraints, particularly in the book and membership data retrieval processes. This high latency is triggered by an increasing volume of data that is still processed using linear scanning or a full table scan method on the database. Therefore, this study aims to optimize query execution time through the design and implementation of the B-Tree indexing algorithm within a MySQL database management system environment. The execution of this research adopts the stages of the Waterfall method to ensure a structured implementation without rebuilding the system from scratch. Testing was executed through two approaches: Black Box functionality testing to validate user interface precision, and Performance Testing to comparatively analyze computational execution times between non-indexed and indexed tables. Empirical experimental results on a population of 10,000 data rows prove that the implementation of the B-Tree algorithm yields highly significant computational efficiency. The average execution time for book data searches was successfully reduced from 2.9651 milliseconds to 0.5895 milliseconds, creating an 80.12% increase in efficiency. In member data retrieval, the execution time was compressed from an average of 5.8076 milliseconds to 0.7430 milliseconds, achieving an efficiency surge of 87.21%. In conclusion, the application of the B-Tree indexing technique is quantitatively proven to resolve data processing latency bottlenecks. This optimization solution enables library circulation services to operate much more responsively and consistently, with waiting times under one millisecond.]]>
