A unified access bound on comparison-based dynamic dictionaries

Mihai Bǎdoiu, Richard Cole, Erik D. Demaine, John Iacono

Research output: Contribution to journalArticle

Abstract

We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w (y) distinct elements have been accessed since the last access to element y, and d (x, y) denotes the rank distance between x and y among the current set of elements, then the amortized cost to access element x is O (miny log [w (y) + d (x, y) + 2]). This property generalizes the working-set and dynamic-finger properties of splay trees.

Original languageEnglish (US)
Pages (from-to)86-96
Number of pages11
JournalTheoretical Computer Science
Volume382
Issue number2
DOIs
StatePublished - Aug 31 2007

Fingerprint

Glossaries
Deletion
Insertion
Denote
Distinct
Costs
Generalise
Dictionary

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A unified access bound on comparison-based dynamic dictionaries. / Bǎdoiu, Mihai; Cole, Richard; Demaine, Erik D.; Iacono, John.

In: Theoretical Computer Science, Vol. 382, No. 2, 31.08.2007, p. 86-96.

Research output: Contribution to journalArticle

Bǎdoiu, Mihai ; Cole, Richard ; Demaine, Erik D. ; Iacono, John. / A unified access bound on comparison-based dynamic dictionaries. In: Theoretical Computer Science. 2007 ; Vol. 382, No. 2. pp. 86-96.
@article{9f6f81e519bb48109e896a61be8fff3a,
title = "A unified access bound on comparison-based dynamic dictionaries",
abstract = "We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w (y) distinct elements have been accessed since the last access to element y, and d (x, y) denotes the rank distance between x and y among the current set of elements, then the amortized cost to access element x is O (miny log [w (y) + d (x, y) + 2]). This property generalizes the working-set and dynamic-finger properties of splay trees.",
author = "Mihai Bǎdoiu and Richard Cole and Demaine, {Erik D.} and John Iacono",
year = "2007",
month = "8",
day = "31",
doi = "10.1016/j.tcs.2007.03.002",
language = "English (US)",
volume = "382",
pages = "86--96",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - A unified access bound on comparison-based dynamic dictionaries

AU - Bǎdoiu, Mihai

AU - Cole, Richard

AU - Demaine, Erik D.

AU - Iacono, John

PY - 2007/8/31

Y1 - 2007/8/31

N2 - We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w (y) distinct elements have been accessed since the last access to element y, and d (x, y) denotes the rank distance between x and y among the current set of elements, then the amortized cost to access element x is O (miny log [w (y) + d (x, y) + 2]). This property generalizes the working-set and dynamic-finger properties of splay trees.

AB - We present a dynamic comparison-based search structure that supports insertions, deletions, and searches within the unified bound. The unified bound specifies that it is quick to access an element that is near a recently accessed element. More precisely, if w (y) distinct elements have been accessed since the last access to element y, and d (x, y) denotes the rank distance between x and y among the current set of elements, then the amortized cost to access element x is O (miny log [w (y) + d (x, y) + 2]). This property generalizes the working-set and dynamic-finger properties of splay trees.

UR - http://www.scopus.com/inward/record.url?scp=34547532086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547532086&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2007.03.002

DO - 10.1016/j.tcs.2007.03.002

M3 - Article

AN - SCOPUS:34547532086

VL - 382

SP - 86

EP - 96

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -