Abstract
This paper proposes and investigates an incremental memory allocation method for mixed database workloads of simple hash-join queries and short read transactions. Traditionally, a DBMS allocates all memory reserved for a query at the beginning of the query execution. However, there may be a prolonged period from the time the query begins to the time that all reserved memory is actually consumed by the query process. We propose to allocate reserved memory to the query incrementally by smaller portions when the query process is actually ready to utilize this memory. Memory that was reserved but not yet allocated to the query can be used temporarily as a shared buffer pool by other components of the workload. Through a series of simulation experiments we demonstrate that the incremental memory allocation for hash-join queries improves the performance of read transactions without penalizing queries.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
