skip to content
A constant update time finger search tree Preview this item
ClosePreview this item
Checking...

A constant update time finger search tree

Author: Rajeev Raman; Paul Frederick Dietz
Publisher: Rochester, N.Y. : University of Rochester, Dept. of Computer Science, [1989]
Series: University of Rochester.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "Levcopolous and Overmars [LO88] described a search tree in which the time to insert or delete a key was O(1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Kos81, HM82,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Rajeev Raman; Paul Frederick Dietz
OCLC Number: 23662275
Notes: "December 1989."
Description: 14 pages ; 28 cm.
Series Title: University of Rochester.; Department of Computer Science.; Technical report
Responsibility: Rajeev Raman, Paul Dietz.

Abstract:

Abstract: "Levcopolous and Overmars [LO88] described a search tree in which the time to insert or delete a key was O(1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Kos81, HM82, Tsa85]. Levcopolous and Overmars left open the question of whether a data structure could be designed which allowed updates in constant time and supported fingers. We answer the question in the affirmative by giving an algorithm in the RAM with logarithmic word size."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/23662275>
library:oclcnum"23662275"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/23662275>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "Levcopolous and Overmars [LO88] described a search tree in which the time to insert or delete a key was O(1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Kos81, HM82, Tsa85]. Levcopolous and Overmars left open the question of whether a data structure could be designed which allowed updates in constant time and supported fingers. We answer the question in the affirmative by giving an algorithm in the RAM with logarithmic word size.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1123628030>
schema:inLanguage"en"
schema:name"A constant update time finger search tree"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.