Semi-automatic, Self-adaptive Control of Garbage Collection Rates in Object Databases

9Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

A fundamental problem in automating object database storage reclamation is determining how often to perform garbage collection. We show that the choice of collection rate can have a significant impact on application performance and that the "best" rate depends on the dynamic behavior of the application, tempered by the particular performance goals of the user. We describe two semi-automatic, self-adaptive policies for controlling collection rate that we have developed to address the problem. Using trace-driven simulations, we evaluate the performance of the policies on a test database application that demonstrates two distinct reclustering behaviors. Our results show that the policies are effective at achieving user-specified levels of I/O operations and database garbage percentage. We also investigate the sensitivity of the policies over a range of object connectivities. The evaluation demonstrates that semi-automatic, self-adaptive policies are a practical means for flexibly controlling garbage collection rate.

Cite

CITATION STYLE

APA

Cook, J. E., Klauser, A. W., Zorn, B. G., & Wolf, A. L. (1996). Semi-automatic, Self-adaptive Control of Garbage Collection Rates in Object Databases. SIGMOD Record (ACM Special Interest Group on Management of Data), 25(2), 377–388. https://doi.org/10.1145/235968.233354

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free