Distributed Data Structures: A Case Study.
Abstract
In spite of the amount of work recently devoted to distributed system, 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 and important aspect of traditional algorithm design, it is important to consider the problem of distributing data structures. This paper investigates 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. Hashing has long been recognized as a fast method for accessing records by key in large relatively static databases. However, when the amount of data is likely to vary significantly, traditional hashing can suffer from performance degradation and may eventually require rehashing all the records into a larger space. Keywords: Distributed programming.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1985
- Accession Number
- ADA166083
Entities
People
- Carla S. Ellis
Organizations
- University of Rochester