Storage reclamation in object oriented database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Empirical analysis of a LISP system
Empirical analysis of a LISP system
Atomic garbage collection: managing a stable heap
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Integrating concurrency control into an object-oriented database system
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
A study of three alternative workstation server architectures for object-oriented database systems
Proceedings of the sixteenth international conference on Very large databases
A stochastic approach for clustering in object bases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
An adaptive tenuring policy for generation scavengers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to object-oriented databases
Introduction to object-oriented databases
A comparative performance evaluation of write barrier implementation
OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
Real-time replication garbage collection
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Atomic incremental garbage collection and recovery for a large stable heap
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Semi-automatic, self-adaptive control of garbage collection rates in object databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
Garbage Collection in a Distributed Object-Oriented System
IEEE Transactions on Knowledge and Data Engineering
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores
Proceedings of the Tenth International Conference on Data Engineering
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Comparative Performance Evaluation of
Comparative Performance Evaluation of
Concurrent atomic garbage collection
Concurrent atomic garbage collection
ACM SIGPLAN Notices
Incremental garbage collection in massive object stores
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Research Frontiers in Object Technology
Information Systems Frontiers
Evaluating Partition Selection Policies Using the PMOS Garbage Collector
POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partitioned garbage collection, in which a subset of the entire database is collected independently of the rest. We evaluate how different application, database system, and garbage collection implementation parameters affect the performance of garbage collection in object database systems. We focus specifically on investigating the policy that is used to select which partition in the database should be collected. Three of the policies that we investigate are based on the intuition that the values of overwritten pointers provide good hints about where to find garbage. A fourth policy investigated chooses the partition with the greatest presence in the I/O buffer. Using simulations based on a synthetic database, we show that one of our policies requires less I/O to collect more garbage than any existing implementable policy. Furthermore, that policy performs close to a locally optimal policy over a wide range of simulation parameters, including database size, collection rate, and database connectivity. We also show what impact these simulation parameters have on application performance and investigate the expected costs and benefits of garbage collection in such systems.