I want it all and I want it now!
Saša Tomić, Tracy K. Camp · 1997
A distributed algorithm for data retrieval in a distributed multimedia database system is presented. The algorithm combines the idea of a token ring algorithm with the use of parallelism to solve the 'hiccups' problem. Data objects are replicated across an array of disk stations to increase the total throughput of the system, and to prevent object requests from becoming unserviceable due to a failure of a disk station. Two replication strategies are examined: media independent partitioning and media type partitioning.