Referenced Items are not available for this document.
In spite of the amount of work recently devoted to distributed systems, distributed applications are relatively rare. One hypothesis to explain this scarcity of 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, the author feels that it is important to consider the problem of distributing data structures. She investigates these issues by developing a distributed version of an extensible hash file, which is a dynamic indexing structure which could be useful in a distributed database.
Published in:
Computers, IEEE Transactions on
(Volume:C-34
,
Issue:
12
)
Date of Publication: Dec. 1985
- Page(s):
- 1178 - 1185
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 2640029
- Digital Object Identifier :
- 10.1109/TC.1985.6312216
- Date of Current Version :
- 25 September 2012
- Issue Date :
- Dec. 1985
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
