[PDF][PDF] Materialized view selection in a multidimensional database
A multidimensional database is a data repository that supports the efficient execution of
complex business decision queries. Query response can be significantly improved by …
complex business decision queries. Query response can be significantly improved by …
Garbage collecting the internet: A survey of distributed garbage collection
SE Abdullahi, GA Ringwood - ACM Computing Surveys (CSUR), 1998 - dl.acm.org
Internet programming languages such as Java present new challenges to garbage-
collection design. The spectrum of garbage-collection schema for linked structures …
collection design. The spectrum of garbage-collection schema for linked structures …
A survey of distributed garbage collection techniques
D Plainfossé, M Shapiro - International Workshop on Memory Management, 1995 - Springer
We present the spectrum of distributed garbage collection techniques. We first describe
those reference counting-based techniques and compare them, in particular with respect to …
those reference counting-based techniques and compare them, in particular with respect to …
Garbage collecting the world: One car at a time
A new garbage collection algorithm for distributed object systems, called DMOS (Distributed.
Mature Object Space), is presented. It is derived from two previous algorithms, MOS (Mature …
Mature Object Space), is presented. It is derived from two previous algorithms, MOS (Mature …
Comprehensive and robust garbage collection in a distributed system
NC Juul, E Jul - … Management: International Workshop IWMM 92 St …, 1992 - Springer
The overall goal of the Emerald garbage collection scheme is to provide an efficient “on-the-
fly” garbage collection in a distributed object-based system that collects all garbage. and that …
fly” garbage collection in a distributed object-based system that collects all garbage. and that …
[PDF][PDF] Collecting distributed garbage cycles by back tracing
U Maheshwari, B Liskov - Proceedings of the sixteenth annual ACM …, 1997 - dl.acm.org
Abstract Systems that store objects at a large number of sites require faulttolerant and timely
garbage collection. A popular technique is to trace each site independently using inter-site …
garbage collection. A popular technique is to trace each site independently using inter-site …
Cyclic weighted reference counting without delay
Many algorithms for storage reclamatiol~ in loosely-coupled systems have been based on
ma. rk-sca. n garbage collection. This is an expensive process for distributed systems …
ma. rk-sca. n garbage collection. This is an expensive process for distributed systems …
A construction of distributed reference counting
L Moreau, J Duprat - Acta Informatica, 2001 - Springer
Distributed reference counting is a general purpose technique, which may be used, eg, to
detect termination of distributed programs or to implement distributed garbage collection. We …
detect termination of distributed programs or to implement distributed garbage collection. We …
A multi-processor shared memory architecture for parallel cyclic reference counting
RD Lius - Microprocessing and microprogramming, 1992 - Elsevier
for Parallel Cyclic Reference Counting 1 Introduction Page 1 Microprocessing and
Microprogramming 35 (1992) 56.3-568 North-Holland 5fi3 A Multi-Processor Shared Memory …
Microprogramming 35 (1992) 56.3-568 North-Holland 5fi3 A Multi-Processor Shared Memory …
Birrell's distributed reference listing revisited
The Java RMI collector is arguably the most widely used distributed garbage collector. Its
distributed reference listing algorithm was introduced by Birrell et al. in the context of …
distributed reference listing algorithm was introduced by Birrell et al. in the context of …