Abstract
This paper is a first step towards an understanding of the inherent limitations of distributed data structures. We propose a model of distributed search trees that is based on few natural assumptions. We prove that any class of trees within our model satisfies a lower bound of Ω(√m) on the worst case height of distributed search trees for m keys. That is, unlike in the single site case, balance in the sense that the tree height satisfies a logarithmic upper bound cannot be achieved. This is true although each node is allowed to have arbitrary degree (note that in this case, the height of a single site search tree is trivially bounded by one). By proposing a method that generates trees of height O(√m), we show the bound to be tight.
Preview
Unable to display preview. Download preview PDF.
References
R. Devine: Design and Implementation of DDM: A Distributed Dynamic Hashing Algorithm. 4th Int. Conference on Foundations of Data Organization on Algorithms FODO, 1993.
B. Kröll, P. Widmayer: Distributing a Search Tree among a Growing Number of Processors. Proc. ACM SIGMOD Conference on the Management of Data, 1994, 265–276.
B. Kröll, P. Widmayer: Balanced Distributed Search Trees Do Not Exist. Technical Report 233, ETH Zürich, 1995.
B. Kröll, P. Widmayer: manuscript, in preparation, 1995.
W. Litwin, M.-A. Neimat, D.A. Schneider: LH * — Linear Hashing for Distributed Files. Proc. ACM SIGMOD Conference on the Management of Data, 1993, 327–336.
W. Litwin, M.-A. Neimat, D.A. Schneider: RP * — A Family of Order Preserving Scalable Distributed Data Structures. Proc. of VLDB, 1994, 342–353.
R. Vingralek, Y. Breitbart, G. Weikum: Distributed File Organization with Scalable Cost/Performance. Proc. ACM SIGMOD Conference on the Management of Data, 1994, 253–264.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kröll, B., Widmayer, P. (1995). Balanced distributed search trees do not exist. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_50
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive