This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to imple...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
HARNESS is an experimental metacomputing system that supports dynamic software reconfiguration, both of the resources that comprise the virtual machine and the services provided t...
This paper characterizes the production workload that highly utilizes the NCSA Origin 2000. The characterization includes the distributions of job interarrival time, requested num...