Garbage Collection in Object Oriented Databases Using Transactional Cyclic Reference Counting.
Srinivas Ashwin, Prasan Roy, S. Seshadri, Abraham Silberschatz, S. Sudarshan:
Garbage Collection in Object Oriented Databases Using Transactional Cyclic Reference Counting.
VLDB 1997: 366-375@inproceedings{DBLP:conf/vldb/AshwinRSSS97,
author = {Srinivas Ashwin and
Prasan Roy and
S. Seshadri and
Abraham Silberschatz and
S. Sudarshan},
editor = {Matthias Jarke and
Michael J. Carey and
Klaus R. Dittrich and
Frederick H. Lochovsky and
Pericles Loucopoulos and
Manfred A. Jeusfeld},
title = {Garbage Collection in Object Oriented Databases Using Transactional
Cyclic Reference Counting},
booktitle = {VLDB'97, Proceedings of 23rd International Conference on Very
Large Data Bases, August 25-29, 1997, Athens, Greece},
publisher = {Morgan Kaufmann},
year = {1997},
isbn = {1-55860-470-7},
pages = {366-375},
ee = {db/conf/vldb/AshwinRSSS97.html},
crossref = {DBLP:conf/vldb/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Garbage Collection is important in object-oriented
databases to free the programmer
from explicitely deallocating memory. In this
paper, we present a garbage collection algorithm,
called Transactional Cyclic Reference
Counting (TCRC), for object oriented
databases. The algorithm is based on a variant
of a reference counting algorithm proposed
for functional programming languages.
The algorithm keeps track of auxiliary reference
count information to detect and collect
cyclic garbage. The algorithms works correctly
in the presence of concurrently running transactions,
and system failures. It does not obtain
any long term locks, thereby minimizing
interference with transaction processing. It
uses recovery subsystem logs to detect pointer
updates; thus existing code need not be rewritten.
Finally, it exploits schema information,
if available, to reduce costs. We have
implemented the TCRC algorithm and present
results of a performance study of the implementation.
Copyright © 1997 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Matthias Jarke, Michael J. Carey, Klaus R. Dittrich, Frederick H. Lochovsky, Pericles Loucopoulos, Manfred A. Jeusfeld (Eds.):
VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece.
Morgan Kaufmann 1997, ISBN 1-55860-470-7
Contents
References
- [AFG95]
- Laurent Amsaleg, Michael J. Franklin, Olivier Gruber:
Efficient Incremental Garbage Collection for Client-Server Object Database Systems.
VLDB 1995: 42-53
- [ARS+97]
- ...
- [Bro84]
- ...
- [Bro85]
- ...
- [CDN93]
- Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton:
The oo7 Benchmark.
SIGMOD Conference 1993: 12-21
- [CWZ94]
- Jonathan E. Cook, Alexander L. Wolf, Benjamin G. Zorn:
Partition Selection Policies in Object Database Garbage Collection.
SIGMOD Conference 1994: 371-382
- [JL91]
- ...
- [Lin90]
- ...
- [MWL90]
- Alejandro D. Martínez, Rosita Wachenchauzer, Rafael Dueire Lins:
Cycle Reference Counting with Local Mark-Scan.
Inf. Process. Lett. 34(1): 31-35(1990)
- [PvEP88]
- ...
- [YNY94]
- Voon-Fee Yong, Jeffrey F. Naughton, Jie-Bing Yu:
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores.
ICDE 1994: 120-131
Copyright © Tue Mar 16 02:22:06 2010
by Michael Ley (ley@uni-trier.de)