LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
OceanStore: an architecture for global-scale persistent storage
ACM SIGPLAN Notices
Proceedings of the 2001 ACM symposium on Applied computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
DEXA '06 Proceedings of the 17th International Conference on Database and Expert Systems Applications
Linux Kernel Development (2nd Edition) (Novell Press)
Linux Kernel Development (2nd Edition) (Novell Press)
Scalable, distributed data structures for internet service construction
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Scalable Distributed Data Structures for Linux-based Multicomputer
ISPDC '08 Proceedings of the 2008 International Symposium on Parallel and Distributed Computing
Fault-Tolerant protocols for scalable distributed data structures
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Distributed memory virtualization with the use of SDDSfL
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Hi-index | 0.00 |
Efficient data management and distribution in a multicomputer is a subject of much research. Distributed file systems are the most common solution of this problem, however, recent works are focused on more general data distribution protocols. Scalable, Distributed Data Structures (SDDS) are another promising approach to this issue. In this paper we discuss the efficiency of an implementation of SDDS in various applications. The results of experiments are presented.