LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Distributed searching of multi-dimensional data: a performance evaluation study
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Snowball: Scalable Storage on Networks of Workstations with Balanced Load
Distributed and Parallel Databases
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
k-RP*s: a scalable distributed data structure for high-performance multi-attribute access
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Distributed Searching of k-Dimensional Data with Almost Constant Costs
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
A Very Efficient Order Preserving Scalable Distributed Data Structure
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
| Hi-index | 0.00 |
Scalable Distributed Data Structures (SDDS) are access methods specifically designed to satisfy the high performance requirements of a distributed computing environment made up by a collection of computers connected through a high speed network. In this paper we propose an order preserving SDDS with a worst-case constant cost for exact-search queries and a worst-case logarithmic cost for update queries. Since our technique preserves the ordering between keys, it is also able to answer to range search queries with an optimal worst-case cost of O(k) messages, where k is the number of servers covering the query range. Moreover, our structure has an amortized almost constant cost for any single-key query.Hence, our proposal is the first solution combining the advantages of the constant worst-case access cost featured by hashing techniques (e.g. LH*) and of the optimal worst-case cost for range queries featured by order preserving techniques (e.g., RP* and DRT). Furthermore, recent proposals for ensuring high-availability to an SDDS can be easily combined with our basic technique. Therefore our solution is a theoretical achievement potentially attractive for network servers requiring both a fast response time and a high reliability.Finally, our scheme can be easily generalized to manage k-dimensional points, while maintaining the same costs of the 1-dimensional case.