Please use this identifier to cite or link to this item: doi:10.22028/D291-26083
Title: Dynamic binary search
Author(s): Mehlhorn, Kurt
Language: English
Year of Publication: 1976
OPUS Source: Saarbrücken, 1976
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: We consider search trees under time-varying access probabilities. Let S=left{ B_{1},...,B_{n}right} and let p_{i}^{t} be the number of accesses to object B_{i} up to time t, W^{t}=sum p_{i}^{t}. We introduce D-trees with the following properties. 1) A search for X=B_{i} at time t takes time O(logW^{t}/p_{i}^{t}). This is nearly optimal. 2) Update time after a search is at most proportional to search time, i.e. the overhead for administration is small.
Link to this record: urn:nbn:de:bsz:291-scidok-40390
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1976/02
Date of registration: 27-Jul-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1976_02.pdf7,75 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.