Partition Selection Policies in Object Database Garbage Collection.

Jonathan E. Cook, Alexander L. Wolf, Benjamin G. Zorn: Partition Selection Policies in Object Database Garbage Collection. SIGMOD Conference 1994: 371-382

@inproceedings{DBLP:conf/sigmod/CookWZ94,
  author    = {Jonathan E. Cook and
               Alexander L. Wolf and
               Benjamin G. Zorn},
  editor    = {Richard T. Snodgrass and
               Marianne Winslett},
  title     = {Partition Selection Policies in Object Database Garbage Collection},
  booktitle = {Proceedings of the 1994 ACM SIGMOD International Conference on
               Management of Data, Minneapolis, Minnesota, May 24-27, 1994},
  publisher = {ACM Press},
  year      = {1994},
  pages     = {371-382},
  ee        = {http://doi.acm.org/10.1145/191839.191913},
  crossref  = {DBLP:conf/sigmod/94},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

The automatic reclamation of storage for unreferenced objects is very important in object databases. Existing language system algorithms for automatic storage reclamation have been shown to be inappropriate. In this paper, 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. Specifically, we investigate the policy that is used to select what partition in the database should be collected. The policies that we propose and investigate are based on the intuition that the values of overwritten pointers provide good hints about where to find garbage. Using trace-driven simulation, we show that one of our policies requires less I/O to collect more garbage than any existing implementable policy and performs close to a near-optimal policy over a wide range of database sizes and object connectivities.

Copyright © 1994 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/smod9397 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Richard T. Snodgrass, Marianne Winslett (Eds.): Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, Minnesota, May 24-27, 1994. ACM Press 1994

, SIGMOD Record 23(2), June 1994
Contents

Online Edition: ACM Digital Library

[Abstract and Index Terms]
[Full Text in PDF Format, 1196 KB]

References

[1]: Henry G. Baker Jr.: List Processing in Real Time on a Serial Computer. Commun. ACM 21(4): 280-294(1978)
[2]: ...
[3]: Margaret H. Butler: Storage Reclamation in Object Oriented Database Systems. SIGMOD Conference 1987: 410-425
[4]: ...
[5]: Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton: The oo7 Benchmark. SIGMOD Conference 1993: 12-21
[6]: Michèle Cart, Jean Ferrié: Integrating Concurrency Control into an Object-Oriented Database System. EDBT 1990: 363-377
[7]: ...
[8]: Hong-Tai Chou, David J. DeWitt: An Evaluation of Buffer Management Strategies for Relational Database Systems. VLDB 1985: 127-141
[9]: ...
[10]: ...
[11]: David J. DeWitt, Philippe Futtersack, David Maier, Fernando Vélez: A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems. VLDB 1990: 107-121
[12]: Aloke Gupta, W. Kent Fuchs: Garbage Collection in a Distributed Object-Oriented System. IEEE Trans. Knowl. Data Eng. 5(2): 257-265(1993)
[13]: Antony L. Hosking, J. Eliot B. Moss, Darko Stefanovic: A Comparative Performance Evaluation of Write Barrier Implementations. OOPSLA 1992: 92-109
[14]: ...
[15]: Elliot K. Kolodner, Barbara Liskov, William E. Weihl: Atomic Garbage Collection: Managing a Stable Heap. SIGMOD Conference 1989: 15-25
[16]: Elliot K. Kolodner, William E. Weihl: Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap. SIGMOD Conference 1993: 177-186
[17]: Henry Lieberman, Carl Hewitt: A Real-Time Garbage Collector Based on the Lifetimes of Objects. Commun. ACM 26(6): 419-429(1983)
[18]: ...
[19]: Karen Shannon, Richard T. Snodgrass: Semantic Clustering. POS 1990: 389-402
[20]: ...
[21]: Alan Jay Smith: Cache Memories. ACM Comput. Surv. 14(3): 473-530(1982)
[22]: Manolis M. Tsangaris, Jeffrey F. Naughton: A Stochastic Approach for Clustering in Object Bases. SIGMOD Conference 1991: 12-21
[23]: David Ungar: Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorithm. Software Development Environments (SDE) 1984: 157-167
[24]: David Ungar, Frank Jackson: An Adaptive Tenuring Policy for Generation Scavengers. ACM Trans. Program. Lang. Syst. 14(1): 1-27(1992)
[25]: Voon-Fee Yong, Jeffrey F. Naughton, Jie-Bing Yu: Storage Reclamation and Reorganization in Client-Server Persistent Object Stores. ICDE 1994: 120-131
[26]: ...

Last update Tue Sep 18 00:25:10 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page