LDT A Logarithmic Distributed Search Tree.pdf

LDT: A Logarithmic Distributed Search Tree Panayiotis Bozanis1 Yannis Manolopoulos2 1University of Thessaly, Argonafton Filellinon, Volos 382 21 Greece 2Aristotle University of Thessaloniki, Thessaloniki 540 06, Greece e-mail: pbozanis@inf.uth.gr, manolopo@csd.auth.gr Abstract We propose LDT, a new Scalable Distributed Search Tree for the dictionary problem, as an alternative to both random trees and deterministic height balanced trees. Our scheme exhibits logarithmic update time, either constant or logarithmic search time for single key queries and output sensitive query time for range search query, depending whether one affords linear or O(n log n) space overhead. Keywords: Distributed Data Structures, Scalability, Network Computing, Binary Search Trees. 1 Introduction As network technology evolves, it provides more prevalent the technological framework known as network computing : fast networks interconnect many powerful and low-priced workstations, creating a pool of perhaps terabytes of RAM and even more of disc space [12]. Every site in such a network is either a server managing data or a client requesting access to data. Every server provides a storage space of b data elements, termed bucket, to accommodate a part of the file under maintenance. Sites communicate by sending and receiving point-to-point messages. The underlying network is assumed error-free; in that way we can devote our concern to efficiency aspects only, i.e., on the number of the messages exchanged between the sites of the networks, irrespectively from the length of a message or the network topology. The distributed algorithms and data structures in such an environment must be designed and implemented so that (a) they should expand to new servers gracefully, and only when servers already used are efficiently loaded; and (b) their access and maintenance operations never require atomic updates to multiple clients, while there is no centralized “access” site. A data structure that meets these