Scalable Distributed Data Structures: A Survey

This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given size that is accessed by a specific number of clients at a specific rate, a scalable distributed data structures (SDDS) can efficiently manage a file that is n times bigger and accessed by n times more clients at the same per-client rate, by adding servers and distributing the file across these servers. We analyze and compare SDDS proposals based on hashing techniques and order preserving techniques. Work regarding the management of multi-dimensional data is also reported. Moreover, issues such as high availability and load control are considered. Keywords scalable distributed data structure, message passing environment, high availability

• Type: Conference
• Year: 2000
• Where: WDAS
• Authors: Adriano Di Pasquale, Enrico Nardelli
• Keywords: Data Structure, Distributed And Parallel Computing, Scalable Data Structures, Scalable Distributed Data, WDAS 2000