We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
The algorithm for stabilising multiple stores, which we present in this paper, was developed in the process of designing the global stability and resilience mechanism for Grasshopp...
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...