Location of Repository

Fast Local Searches and Updates in Bounded Universes

By Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat and Pat Morin


Given a bounded universe {0, 1,..., U −1}, we show how to perform (successor) searches in O(log log ∆) expected time and updates in O(log log ∆) expected amortized time, where ∆ is the rank difference between the element being searched for and its successor in the structure. This unifies the results of traditional bounded universe structures (which support successor searches in O(log log U) time) and hashing (which supports exact searches in O(1) time). We also show how these results can be extended to answer approximate nearest neighbour queries in low dimensions.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
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://cg.scs.carleton.ca/%7Ev... (external link)
  • Suggested articles

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