This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dec. 1985 (vol. 34 no. 12)
pp. 1178-1185
Carla Schlatter Ellis, Department of Computer Science, University of Rochester, Rochester, NY 14627
In spite of the amount of work recently devoted to distributed systems, distributed applications are relatively rare. One hypothesis to explain this scarcity of different examples is a lack of experience with algorithm design techniques tailored to an environment in which out-of-date and incomplete information is the rule. Since the design of data structures is an important aspect of traditional algorithm design, we feel that it is important to consider the problem of distributing data structures. In this correspondence, we investigate these issues by developing a distributed version of an extendible hash file which is a dynamic indexing structure that could be useful in a distributed database.
Index Terms:
replication,Data structures,distributed algorithms,distributed database,extendible hashing,fault tolerance
Citation:
Carla Schlatter Ellis, "Distributed data structures: A case study," IEEE Transactions on Computers, vol. 34, no. 12, pp. 1178-1185, Dec. 1985, doi:10.1109/TC.1985.6312216
Usage of this product signifies your acceptance of the Terms of Use.