| | |
Summary: Consistent, Order-Preserving Data Management
in Distributed Storage Systems
Baruch Awerbuch
Department of Computer Science
Johns Hopkins University
3400 N. Charles Street
Baltimore, MD 21218, USA
baruch@cs.jhu.edu
Christian Scheideler
Department of Computer Science
Johns Hopkins University
3400 N. Charles Street
Baltimore, MD 21218, USA
scheideler@cs.jhu.edu
February 5, 2004
Abstract
In this paper we consider the problem of maintaining a mapping of data objects to memory modules
so that the mapping is order preserving, i.e. objects closely together in the sorted set of current objects
are also closely together in the mapping. Keeping close objects closely together is important for many
applications such as efficiently executing programs using a large amount of space or complex search
|
