Article thumbnail

LDT: a Logarithmic Distributed Search

By Panayiotis Bozanis and Yannis Manolopoulos

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(nlogn) space overhead

Topics: Scalability, Network Computing, Binary Search Trees, 1-d Range Query, Node Aggregation, Topology Trees
Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.4987
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://delab.csd.auth.gr/paper... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.