In modern database management systems (DBMS), data retrieval typically requires traversing multiple layers—such as secondary indexes, primary indexes, and buffer pools—which introduces significant overhead and creates performance bottlenecks. In this paper, we propose a novel method that minimizes this overhead by establishing more direct access paths during data retrieval. Our experimental results demonstrate substantial efficiency gains across various DBMS components, including secondary indexing and concurrency control mechanisms. Specifically, we observe that implementing direct access paths can boost the throughput of transaction processing systems by up to 19.7× when executing the TPC-C-like benchmark with 40 threads. Furthermore, our approach holds promise for broader applications, potentially transforming data retrieval practices by enabling efficient handling of data movements with minimal overhead.
Building similarity graph...
Analyzing shared references across papers
Loading...
Riki Otaki
Jun Hyuk Chang
Aaron J. Elmore
Proceedings of the VLDB Endowment
University of Chicago
Google (United States)
Building similarity graph...
Analyzing shared references across papers
Loading...
Otaki et al. (Tue,) studied this question.
www.synapsesocial.com/papers/68c189d29b7b07f3a061331a — DOI: https://doi.org/10.14778/3749646.3749680