This master's thesis investigates the feasibility of incorporating distributed garbage collection into the XML Store. Garbage collection with emphasis on the distributed case is surveyed. A theoretical model for garbage collecting the XML Store is presented. Existing garbage collection algorithms are projected onto the XML Store and their feasibility is analyzed.
The challenge with distributed and incremental garbage collectors is that synchronization between the collectors and the user programs (also referred to as the mutators) is needed because they share data that they all are capable of updating. Even though mutators in the XML Store cannot update data, it is not of any apparent advantage to the garbage collection techniques applied to the XML Store in this thesis. Synchronization is still needed.
Design proposals for three distributed garbage collectors are presented. A collector based on a local copying collector and reference listing is implemented and evaluated. Evaluation shows that distributed garbage collection is feasible for the XML Store.
Last updated: August 28th, 2003
Mads Pultz