Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
A calculus for complex objects
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
CommonLoops: merging Lisp and object-oriented programming
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Compact Encodings of List Structure
ACM Transactions on Programming Languages and Systems (TOPLAS)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
Making smalltalk a database system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
Partition selection policies in object database garbage collection
SIGMOD '94 Proceedings of the 1994 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 for a client-server persistent object store
ACM Transactions on Computer Systems (TOCS)
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
IEEE Transactions on Knowledge and Data Engineering
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.01 |
When providing data management for nontraditional data, database systems encounter storage reclamation problems similar to those encountered by virtual memory managers. The paging behavior of existing automatic storage reclamation schemes as applied to objects stored in a database management system is one indicator of the performance cost of various features of storage reclamation algorithms. The results of modeling the paging behavior suggest that Mark and Sweep causes many more input/output operations than Copy-Compact. A contributing factor to the expense of Mark and Sweep is that it does not recluster memory as does Copy-Compact. If memory is not reclustered, the average cost of accessing data can go up tremendously. Other algorithms that do not recluster memory also suffer performance problems, namely all reference counting schemes. The main advantage of a reference count scheme is that it does not force a running program to pause for a long period of time while reclamation takes place, it amortizes the cost of reclamation across all accesses. The reclustering of Copy-Compact and the cost amortization of Reference Count are combined to great advantage in Baker's algorithm. This algorithm proves to be the least prohibitive for operating on disk-based data.